var
    tot,i,j,n,g,m,k,l,t,x,aa,bb,tmp,tmp2,s,head,tail:longint;
    a:array[-2..6000100]of record
      tt,vv,next:longint;
    end;
    b:array[-2..2000100]of boolean;
    d:array[-2..2000100]of longint;
    q:array[1..2000100]of longint;
  function max(x,y:longint):longint;
    begin
      if x>y then exit(x);
      exit(y);
    end;
  procedure specialdoit;
    begin
      k:=maxlongint;
      for i:=1 to max(n,m)-1 do
        begin
          read(x);
          if x<k then k:=x;
        end;
      writeln(k);
      close(input);
      close(output);
      halt;
    end;
  procedure linkit(z,zz,v:longint);
    begin
      if a[z].tt=0 then
        begin
          a[z].tt:=zz;
          a[z].vv:=v;
        end
      else begin
        inc(tot);
        a[tot].next:=a[z].next;
        a[tot].tt:=zz;
        a[tot].vv:=v;
        a[z].next:=tot;
      end;
      if a[zz].tt=0 then
        begin
          a[zz].tt:=z;
          a[zz].vv:=v;
        end
      else begin
        inc(tot);
        a[tot].next:=a[zz].next;
        a[tot].tt:=z;
        a[tot].vv:=v;
        a[zz].next:=tot;
      end;
    end;
  procedure spfa;
    var
      i,j:longint;
    begin
      head:=0;tail:=1;
      q[1]:=-1;d[-1]:=0;
      while head<>tail do
        begin
          inc(head);
          if head=2000001 then head:=1;
          k:=q[head];
          x:=k;
          while x<>0 do
            begin
              tmp:=a[x].vv;
              g:=a[x].tt;
              if d[k]+tmp<d[g] then
                begin
                  d[g]:=d[k]+tmp;
                  if not b[g] then
                    begin
                      b[g]:=true;
                      inc(tail);
                      if tail=2000001 then tail:=1;
                      q[tail]:=g;
                    end;
                end;
              x:=a[x].next;
            end;
          b[k]:=false;
        end;
    end;
  begin
    s:=-1;
    t:=-2;
    tot:=2000000;
    readln(n,m);
    if (n=1)or(m=1) then specialdoit;
 
    for i:=1 to n do
      for j:=1 to m-1 do
        begin
          tmp:=(i-1)*(m-1)*2;
          tmp2:=(i-2)*(m-1)*2;
          read(x);
          if i=1 then begin
            aa:=t;
            bb:=j*2;
            linkit(aa,bb,x);
          end
          else if i=n then begin
            aa:=s;
            bb:=tmp2+j*2-1;
            linkit(aa,bb,x);
          end
          else begin
            aa:=tmp2+j*2-1;
            bb:=tmp+j*2;
            linkit(aa,bb,x);
          end;
        end;
 
    for i:=1 to n-1 do
      for j:=1 to m do
        begin
          tmp:=(i-1)*(m-1)*2;
          read(x);
          if j=1 then begin
            aa:=s;
            bb:=tmp+j*2-1;
            linkit(aa,bb,x);
          end
          else if j=m then begin
            aa:=t;
            bb:=tmp+(j-1)*2;
            linkit(aa,bb,x);
          end
          else begin
            aa:=tmp+(j-1)*2;
            bb:=tmp+j*2-1;
            linkit(aa,bb,x);
          end;
        end;
 
    for i:=1 to n-1 do
      for j:=1 to m-1 do
        begin
          tmp:=(i-1)*(m-1)*2;
          read(x);
          aa:=tmp+j*2;
          bb:=aa-1;
          linkit(aa,bb,x);
        end;
    fillchar(d,sizeof(d),11);
    spfa;
    write(d[t])
  end.