#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define popcnt(x) __builtin_popcount(x)
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pil = pair<int, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<ll>>;

// const int mod = 998244353;
const int mod = 1000000007;
struct mint {
  ll x;  // typedef long long ll;
  mint(ll x = 0) : x((x % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod - a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const { return mint(*this) += a; }
  mint operator-(const mint a) const { return mint(*this) -= a; }
  mint operator*(const mint a) const { return mint(*this) *= a; }
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1) a *= *this;
    return a;
  }

  // for prime mod
  mint inv() const { return pow(mod - 2); }
  mint& operator/=(const mint a) { return *this *= a.inv(); }
  mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream& operator>>(istream& is, mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }

// const int inf = 1e9;
const ll inf = 1e18;
int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};

void chmin(double& a, double b) { a = min(a, b); }

int g[305][305];

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  int h,w;
  cin>>h>>w;
  rep(i,h)rep(j,w) cin>>g[i][j];
  vi r(h);
  rep(i,h) cin>>r[i];
  vi c(h);
  rep(j,w) cin>>c[j];

  mf_graph<ll> mf(h+w+2);
  ll ans=0;
  int s,t;
  s=h+w;
  t=s+1;

  rep(i,h){
    mf.add_edge(s,i,r[i]);
    ll sum=0;
    rep(j,w) sum+=g[i][j];
    mf.add_edge(i,t,sum);
    ans+=r[i];
  }
  rep(j,w){
    mf.add_edge(s,j+h,c[j]);
    ans+=c[j];
    rep(i,h) mf.add_edge(j+h,i,g[i][j]);
  }
  ans-=mf.flow(s,t);
  cout<<ans<<endl;

  return 0;
}