//#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
#define NIMI_GRAPH

#include <vector>

namespace nimi {
struct base_edge {
  int from;
  int to;
  base_edge(int from, int to) : from(from), to(to) {}
};

template <class T> struct edge : public base_edge {
  T val;
  edge(int from, int to, T v) : base_edge(from, to), val(v) {}
};

template <> struct edge<void> : public base_edge {
  edge(int from, int to) : base_edge(from, to) {}
};
template <class C> struct maxflow_edge : public base_edge {
  C cap;
  std::size_t rev;
  maxflow_edge(int from, int to, C cap, std::size_t rev)
      : base_edge(from, to), cap(cap), rev(rev) {}
};

template <class C> struct mcf_edge : public base_edge {
  C cap;
  C cost;
  std::size_t rev;
  mcf_edge(int from, int to, C cap, C cost, std::size_t rev)
      : base_edge(from, to), cap(cap), cost(cost), rev(rev) {}
};

template <class T>
struct directed_graph : public std::vector<std::vector<edge<T>>> {
  directed_graph(std::size_t n) : std::vector<std::vector<edge<T>>>(n) {}
  void add_edge(const edge<T> &e) { this->at(e.from).push_back(e); }
};

template <class T>
struct undirected_graph : public std::vector<std::vector<edge<T>>> {
  undirected_graph(std::size_t n) : std::vector<std::vector<edge<T>>>(n) {}
  void add_edge(const edge<T> &e) {
    this->at(e.from).push_back(e);
    edge<T> re = e;
    std::swap(re.from, re.to);
    this->at(e.to).push_back(re);
  }
};

template <class C>
struct maxflow_graph : public std::vector<std::vector<maxflow_edge<C>>> {
  maxflow_graph(std::size_t n) : std::vector<std::vector<maxflow_edge<C>>>(n) {}
  void add_edge(int from, int to, C cap, std::size_t rev_cap = 0) {
    this->at(from).push_back(
        maxflow_edge<C>(from, to, cap, this->at(to).size()));
    this->at(to).push_back(
        maxflow_edge<C>(to, from, rev_cap, this->at(from).size() - 1));
  }
};

template <class C>
struct mcf_graph : public std::vector<std::vector<mcf_edge<C>>> {
  mcf_graph(std::size_t n) : std::vector<std::vector<mcf_edge<C>>>(n) {}
  void add_edge(int from, int to, C cap, C cost, std::size_t rev_cap = 0) {
    this->at(from).push_back(
        mcf_edge<C>(from, to, cap, cost, this->at(to).size()));
    this->at(to).push_back(
        mcf_edge<C>(to, from, rev_cap, -cost, this->at(from).size() - 1));
  }
};
} // namespace nimi

#endif
#ifndef NIMI_GRAPH_MAXFLOW_DINIC
#define NIMI_GRAPH_MAXFLOW_DINIC

#include <functional>
#include <limits>
#include <queue>
#include <vector>


namespace nimi {
template <class C>
C dinic(nimi::maxflow_graph<C> &g, std::size_t s, std::size_t t) {
  C inf = std::numeric_limits<C>::max();
  C ans = 0;
  std::size_t n = g.size();

  std::vector<int> level(n);
  std::vector<std::size_t> iter(n);

  std::function<void(void)> g_level = [&]() {
    level.assign(n, -1);
    std::queue<int> que;
    que.push(s);
    level[s] = 0;
    while (!que.empty()) {
      int v = que.front();
      que.pop();
      for (const auto &e : g[v]) {
        if (e.cap > 0 && level[e.to] == -1) {
          level[e.to] = level[e.from] + 1;
          que.push(e.to);
        }
      }
    }
  };

  std::function<C(int, C)> dinic_dfs = [&](int v, C f) {
    if (v == t)
      return f;
    C now = f;

    for (std::size_t &i = iter[v]; i < g[v].size(); i++) {
      auto &e = g[v][i];
      if (e.cap > 0 && level[e.to] > level[e.from]) {
        C ff = dinic_dfs(e.to, std::min(now, e.cap));
        e.cap -= ff;
        g[e.to][e.rev].cap += ff;
        now -= ff;
        if (now == 0)
          return f - now;
      }
    }
    return f - now;
  };

  while (1) {
    g_level();
    if (level[t] < 0)
      break;
    C f;
    iter.assign(n, 0);
    while ((f = 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_graph<u64> g(h + w + 2);
  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.add_edge(i, h + j, c);
      g.add_edge(s, i, c);
    }
  }
  u64 ans = 0;
  for (const usize i : rep(0, h)) {
    const u64 c = scan<u64>();
    ans += c;
    g.add_edge(i, t, c);
  }
  for (const usize i : rep(0, w)) {
    const u64 c = scan<u64>();
    ans += c;
    g.add_edge(h + i, t, c);
  }
  std::cout << ans - nimi::dinic(g, s, t) << std::endl;
}

} // namespace n91

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