//#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>

namespace n91 {

using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

struct rep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
struct revrep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) noexcept {
  if (a < b) {
    return b - a;
  } else {
    return a - b;
  }
}
template <class T> void chmin(T &a, const T &b) noexcept {
  if (b < a) {
    a = b;
  }
}
template <class T> void chmax(T &a, const T &b) noexcept {
  if (a < b) {
    a = b;
  }
}
template <class F> class fix_point : private F {
public:
  explicit constexpr fix_point(F &&f) : F(std::forward<F>(f)) {}

  template <class... Args>
  constexpr decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, std::forward<Args>(args)...);
  }
};
template <class F> constexpr decltype(auto) make_fix(F &&f) {
  return fix_point<F>(std::forward<F>(f));
}
template <class T> T scan() {
  T ret;
  std::cin >> ret;
  return ret;
}

} // namespace n91

#ifndef NIMI_GRAPH_MAXFLOW_DINIC
#define NIMI_GRAPH_MAXFLOW_DINIC

#include <algorithm>
#include <array>
#include <limits>
#include <queue>

namespace nimi {

template <class C, std::size_t N>
using maxflow_array_matrix = std::array<std::array<C, N>, N>;

template <class C, std::size_t N>
C dinic(maxflow_array_matrix<C, N> &g, std::size_t s, std::size_t t) {
  using size_t = std::size_t;

  constexpr C Inf = std::numeric_limits<C>::max();
  C ans = 0;

  std::array<size_t, N> level;
  std::array<size_t, N> iter;

  const auto g_level = [&]() {
    std::fill(level.begin(), level.end(), N);
    std::queue<size_t> que;
    que.push(s);
    level[s] = 0;
    while (!que.empty()) {
      const size_t v = que.front();
      que.pop();
      for (size_t i = 0; i != N; i += 1) {
        if (g[v][i] != 0 && level[i] == N) {
          level[i] = level[v] + 1;
          que.push(i);
        }
      }
    }
  };

  const auto dinic_dfs = [&](const auto &dinic_dfs, const size_t v,
                             const C f) -> C {
    if (v == t)
      return f;
    C now = f;

    for (size_t &i = iter[v]; i != N; i += 1) {
      if (g[v][i] != 0 && level[i] > level[v]) {
        const C ff = dinic_dfs(dinic_dfs, i, std::min(now, g[v][i]));
        g[v][i] -= ff;
        g[i][v] += ff;
        now -= ff;
        if (now == 0)
          return f;
      }
    }
    return f - now;
  };

  while (true) {
    g_level();
    if (level[t] == N)
      break;
    C f;
    std::fill(iter.begin(), iter.end(), 0);
    while ((f = dinic_dfs(dinic_dfs, s, Inf)) != 0)
      ans += f;
  }

  return ans;
}

} // namespace nimi

#endif

#include <algorithm>
#include <iostream>
#include <utility>
#include <vector>

namespace n91 {

void main_() {
  //*
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  //*/
  const usize h = scan<usize>();
  const usize w = scan<usize>();
  nimi::maxflow_array_matrix<u64, 602> g = {};
  const usize s = h + w;
  const usize t = h + w + 1;
  for (const usize i : rep(0, h)) {
    for (const usize j : rep(0, w)) {
      const u64 c = scan<u64>();
      g[i][h + j] += c;
      g[s][i] += c;
    }
  }
  u64 ans = 0;
  for (const usize i : rep(0, h)) {
    const u64 c = scan<u64>();
    ans += c;
    g[i][t] += c;
  }
  for (const usize i : rep(0, w)) {
    const u64 c = scan<u64>();
    ans += c;
    g[h + i][t] += c;
  }
  std::cout << ans - nimi::dinic(g, s, t) << std::endl;
}

} // namespace n91

int main() {
  n91::main_();
  return 0;
}