Khinh khí cầu

program kkcau;
const fi='khicau.inp';
        fo='khicau.out';
var c1,c2,c3,l:array[0..100,0..100] of integer;
    i,j,k,n,h,v:integer; f:text;
    dd:array[1..200] of integer;

procedure nhap;
 begin
  assign(f,fi);
  reset(f);
  readln(f,h,v);
  for i:=0 to h do
  begin
    for j:=1 to v-1 do read(f,c1[i,j]);
    readln(f,c1[i,v]);
  end;
  for i:=0 to v do
  begin
    for j:=1 to h-1 do read(f,c2[j,i]);
    readln(f,c2[h,i]);
  end;
  for i:=1 to h do
  begin
    for j:=1 to v-1 do read(f,c3[i,j]);
    readln(f,c3[i,v]);
  end;
  close(f);
 end;

procedure tinh;
 begin
  for i:=0 to h do for j:=0 to v do l[i,j]:=0;
  l[0,1]:=c1[0,1];
  l[1,0]:=c2[1,0];
  for i:=2 to v do l[0,i]:=l[0,i-1]+c1[0,i];
  for i:=2 to h do l[i,0]:=l[i-1,0]+c2[i,0];

  for i:=1 to h do
  for j:=1 to v do
    begin
    l[i,j]:=l[i-1,j-1]+c3[i,j];
    if l[i,j]>l[i,j-1]+c1[i,j] then l[i,j]:=l[i,j-1]+c1[i,j];
    if l[i,j]>l[i-1,j]+c2[i,j] then l[i,j]:=l[i-1,j]+c2[i,j];
    end;
 end;

procedure try(i,j:integer);
 begin
  if (i=0)and(j=0) then
  begin
    k:=k+1;
    for h:=n downto 1 do write(f,dd[h],' ');
    writeln(f);
  end;
  if l[i,j]=l[i-1,j-1]+c3[i,j] then
  begin
    n:=n+1; dd[n]:=3;
    try(i-1,j-1);
    n:=n-1;
  end;
  if l[i,j]=l[i,j-1]+c1[i,j] then
  begin
    n:=n+1; dd[n]:=1;
    try(i,j-1);
    n:=n-1;
  end;
  if l[i,j]=l[i-1,j]+c2[i,j] then
  begin
    n:=n+1; dd[n]:=2;
    try(i-1,j);
    n:=n-1;
  end;
 end;

procedure xuat;
 begin
  assign(f,fo);
  rewrite(f);
  writeln(f,l[h,v]);
  k:=0; n:=0;
  try(h,v);
  write(f,k);
  close(f);
 end;

begin
 nhap;
 tinh;
 xuat;
end.

4 5
13 18 10 15 17
15 12 10 11 16
16 18 13 15 12
10 12 10 14 13
13 12 10 10 9
10 8 13 15
12 16 14 14
16 14 12 13
13 12 13 12
18 13 16 11
19 9 10 10
20 18 16 25 21
25 24 18 19 14
17 20 18 21 19
20 18 17 16 15

82
2 2 3 1 1 3 1
2 2 3 3 1 1 1
2