output_description: Print the minimum unbalancedness possible.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      H W
      A_{11} A_{12} \ldots A_{1W}
      :
      A_{H1} A_{H2} \ldots A_{HW}
      B_{11} B_{12} \ldots B_{1W}
      :
      B_{H1} B_{H2} \ldots B_{HW}
attempt: print()
  
problem_description: Statement
  
  We have a grid with H horizontal rows and W vertical columns. Let (i,j) denote
  the square at the i-th row from the top and the j-th column from the left.
  
  The square (i, j) has two numbers A_{ij} and B_{ij} written on it.
  
  First, for each square, Takahashi paints one of the written numbers red and
  the other blue.
  
  Then, he travels from the square (1, 1) to the square (H, W). In one move, he
  can move from a square (i, j) to the square (i+1, j) or the square (i, j+1).
  He must not leave the grid.
  
  Let the _unbalancedness_ be the absolute difference of the sum of red numbers
  and the sum of blue numbers written on the squares along Takahashi's path,
  including the squares (1, 1) and (H, W).
  
  Takahashi wants to make the unbalancedness as small as possible by
  appropriately painting the grid and traveling on it.
  
  Find the minimum unbalancedness possible.
samples: [{"input": "2 2\n    1 2\n    3 4\n    3 4\n    2 1", "output": "0\n    \n\nBy painting the grid and traveling on it as shown in the figure below, the sum\nof red numbers and the sum of blue numbers are 3+3+1=7 and 1+2+4=7,\nrespectively, for the unbalancedness of 0.\n\n![Figure](https://img.atcoder.jp/ghi/a7eefcd144e470dad1d3f833a6806f2c.png)\n\n* * *"}, {"input": "2 3\n    1 10 80\n    80 10 1\n    1 2 3\n    4 5 6", "output": "2"}]