#define STOPIT
#include <bits/stdc++.h>
#define loop(n) for (int ngtkana_is_a_genius = 0; ngtkana_is_a_genius < int(n); ngtkana_is_a_genius++)
#define rep(i, begin, end) for (int i = int(begin); (i) < int(end); i++)
#define all(v) v.begin(), v.end()
#define rand(l, r) std::uniform_int_distribution<>(l, r)(mt)
using lint = long long;
auto mt = std::mt19937_64(std::random_device{}());
auto cmn = [](auto& a, auto b){ if (a > b) {a = b; return true;} return false; };
auto cmx = [](auto& a, auto b){ if (a < b) {a = b; return true;} return false; };
void debug_impl() { std::cerr << std::endl; }
template <typename Head, typename... Tail>
void debug_impl(Head head, Tail... tail) { std::cerr << " " << head; debug_impl(tail...); }
#ifndef STOPIT
#define debug(...)\
  do {\
    std::cerr << std::boolalpha << "[" << #__VA_ARGS__ << "]:";\
    debug_impl(__VA_ARGS__);\
    std::cerr << std::noboolalpha;\
  } while (false)
#else
#define debug(...) {}
#endif

template < typename Container, typename Value = typename Container::value_type, std::enable_if_t<!std::is_same< Container, std::string >::value, std::nullptr_t> = nullptr>
std::istream& operator>> (std::istream& is, Container& v)
  { for (auto & x : v) { is >> x; } return is; }

template < typename Container, typename Value = typename Container::value_type, std::enable_if_t<!std::is_same< Container, std::string >::value, std::nullptr_t> = nullptr >
std::ostream& operator<< (std::ostream& os, Container const& v) {
 os << "{";
  for (auto it = v.begin(); it != v.end(); it++)
    {os << (it != v.begin() ? "," : "") << *it;}
  return os << "}";
}

template <typename T>
auto make_vector_impl(size_t sz, T t) {return std::vector<T>(sz, t);}

template <size_t N, typename T, typename U, std::enable_if_t<N == 1, std::nullptr_t> = nullptr>
auto make_vector(size_t sz, U u) {return make_vector_impl(sz, T(u));}

template <size_t N, typename T, std::enable_if_t<N == 1, std::nullptr_t> = nullptr>
auto make_vector(size_t sz) {return std::vector<T>(sz);}

template <size_t N, typename T, typename... Args, std::enable_if_t<N != 1, std::nullptr_t> = nullptr>
auto make_vector(size_t a, Args... args) {return make_vector_impl(a, make_vector<N - 1, T>(args...));}

template <typename T, typename Size_t>
auto& at(T& t, Size_t i) {return t.at(i);}

template <typename T, typename Size_t, typename... Args>
auto& at(T& t, Size_t i, Args... args) {return at(t.at(i), args...);}

// require gcc >= 7.1.0
template < class ... Keys >
class fmt_t {
    using storage_t = std::tuple< Keys ... >;
    storage_t storage;
    static constexpr std::size_t N = sizeof ... (Keys);

    // is_exact_match_impl
    template < std::size_t I, class Value >
      auto is_exact_match_impl(long, Value) const
        { return false; }

    template < std::size_t I, class Value,
      std::enable_if_t<
        std::is_same< std::decay_t< Value > , char >::value
        == std::is_same< std::tuple_element_t< I, storage_t >, char >::value,
      std::nullptr_t > = nullptr,
      class = decltype(std::declval< Value >() == std::get< I >(std::declval< storage_t >())) >
      auto is_exact_match_impl(int, Value x) const
        { return x == std::get< I >(storage); }

    template < class Value, std::size_t ... Is >
      auto find_exact_match_impl(Value x, std::integer_sequence< std::size_t, Is ... >) const {
        auto ret = false;
        (void)std::initializer_list< std::nullptr_t >
          { (ret |= is_exact_match_impl< Is >(int{}, x), nullptr) ...  };
        return ret;
      }

    template < class Value >
      auto exists_exact_match(Value x) const
      {  return find_exact_match_impl(x, std::make_index_sequence< N >()); }

    // tuple_format_impl
    template < class Tuple,  std::size_t ... Is >
    std::string tuple_format_impl(const Tuple& tuple, std::integer_sequence< std::size_t, Is ... >) const {
      std::string ret = "(";
      (void)std::initializer_list< std::nullptr_t >
        { (ret = ret + (Is == 0 ? "" : ",") + format(std::get< Is >(tuple)), nullptr) ... };
      return ret + ")";
    }

    // usual_format
    template < class Value >
    std::string usual_format(long, Value x) const
      { return std::to_string(x); }

    template < class Value, std::enable_if_t< std::is_same< std::decay_t< Value >, char >::value, std::nullptr_t > = nullptr >
    std::string usual_format(int, Value c) const
      { return std::string{'\''} + std::string{c} + std::string{'\''}; }

    std::string usual_format(int, char const* s) const
      { return "\"" + std::string(s) + "\""; }

    std::string usual_format(int, std::string const s) const
      { return "\"" + s + "\""; }

    template < class Container, class = typename Container::value_type >
    std::string usual_format(int, Container const & v) const {
      return "{" + std::accumulate(v.begin(), v .end(), std::string{},
        [this](auto const& s, auto const x) { return s + (s.empty() ? "" : ",") + this->format(x); })
        + "}";
    }

    template < class Tuple, std::size_t N = std::tuple_size< Tuple >::value >
    std::string usual_format(int, Tuple const& tuple) const
      { return tuple_format_impl(tuple, std::make_index_sequence< N >()); }

    // format
    template < class Value > std::string format(Value&& x) const
      { return exists_exact_match(x) ? std::string{'_'} : usual_format(int{}, x); }

  public:
    fmt_t()=default;
    template < Keys ... > fmt_t(Keys&& ... keys ) : storage(keys ... ){}

    template < class Value > std::string operator()(Value&& x) const
      { return format(x); }
};
template < class ... Keys > auto fmt(Keys&& ... keys)
  { return fmt_t< Keys ... >(std::forward< Keys >(keys) ... ); }

int main() {
  std::cin.tie(0); std::cin.sync_with_stdio(false);
  int h, w; std::cin >> h >> w;
  auto a = make_vector<2,int>(h,w);
  rep(i,0,h) rep(j,0,w) {
    int x; std::cin >> x;
    at(a,i,j) += x;
  }
  rep(i,0,h) rep(j,0,w) {
    int x; std::cin >> x;
    at(a,i,j) -= x;
  }
  // for (auto& v : a) debug(v);

  int g = 80*160;
  debug(g);

  int G = 2*g+1;
  std::vector<std::vector<std::vector<int>>>
    dp(h, std::vector<std::vector<int>>(w, std::vector<int>(G)));
  at(dp,0,0,+at(a,0,0)+g) = true;
  at(dp,0,0,-at(a,0,0)+g) = true;
  rep(i,0,h) rep(j,0,w) {
    int x = at(a,i,j);
    rep(k,-g,g+1) {
      for (int s : {-1,1}) {
        int l = k + s*x;
        if (l < -g || g < l) continue;
        if (0 < i) dp[i][j][l+g] |= dp[i-1][j][k+g];
        if (0 < j) dp[i][j][l+g] |= dp[i][j-1][k+g];
        // if (0 < i) at(dp,i,j,l+g) |= at(dp,i-1,j,k+g);
        // if (0 < j) at(dp,i,j,l+g) |= at(dp,i,j-1,k+g);
      }
    }
  }

  // debug
  // rep(i,0,h) rep(j,0,w) {
  //   auto&& v = at(dp,i,j);
  //   std::vector<int> w;
  //   rep(k,0,g+1) {
  //     if (v.at(k+g)) w.emplace_back(k);
  //   }
  //   debug(w);
  // }

  int ans = g;
  rep(k,0,g+1) {
    if (at(dp,h-1,w-1,g+k)) cmn(ans,k);
  }
  std::cout << ans << std::endl;
  return 0;
}

Measured memory_bytes: 650752