#include<bits/stdc++.h>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
typedef long long ll;
const long long INF = 1LL<<60;
const double PI = acos(-1.0);
/*const double PI = atan2(0.0,-1.0)*/
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep1(i,aa,n) for(ll i = aa; i <= (ll)(n); i++)
#define ALL(a)  (a).begin(),(a).end()
#define ar_init(aa,val) rep(i,aa.size()) aa[i]=val;
#define v2d(aa,val1,val2,ini) vector<vector<ll>> aa(val1,vector<ll>(val2,ini));
#define pqe priority_queue<ll>
#define pqeg priority_queue<ll,vector<ll>,greater<ll>>
#define lcin(...) ll __VA_ARGS__;CINT(__VA_ARGS__)
#define eout(...) COU(__VA_ARGS__);
#define sout(...) SCOU(__VA_ARGS__);
#define scin(...) string __VA_ARGS__;CINT(__VA_ARGS__)
#define lb(aa,val) lower_bound(ALL(aa),val)
#define pb push_back
#define mkp make_pair
ll kaijou(ll e){ll r=1;rep(i,e){r*=(i+1);}return r;}

void CINT(){}
template <class Head,class... Tail>
void CINT(Head&& head,Tail&&... tail){
    cin>>head;
    CINT(move(tail)...);
}

void COU(){}
template <class Head,class... Tail>
void COU(Head&& head,Tail&&... tail){
    cout<<head<<endl;
    COU(move(tail)...);
}

void SCOU(){}
template <class Head,class... Tail>
void SCOU(Head&& head,Tail&&... tail){
    cout<<head<<" ";
    SCOU(move(tail)...);
}

template <class T = ll>
T IN(){T x;cin>>x;return (x);}

using pii = pair<ll,ll>;
using v2 = vector<vector<ll>>;
using v1 = vector<ll>;
using v2p = vector<vector<pii>>;
using v1p = vector<pii>;
const ll mo=1000000007;
//const ll mo=998244353;

v2 mat_pow(v2 en,ll n){
ll si=en.size();
//n==0のときreturn単位行列
if(n==0){
rep(i,en.size()) rep(k,en.size()){
if(i==k){
en[i][k]=1;
}else{
en[i][k]=0;
}
}
return en; 
}

auto dfs = [&](auto self,ll ko) -> v2 {
if(ko==1){
return en;
}

auto e=self(self,ko/2);
v2d(res,si,si,0);
rep(i,res.size()){
rep(k,res.size()){
rep(m,res.size()){
res[i][k]+=e[i][m]*e[m][k]%mo;
res[i][k]%=mo;
}
}
}
v2d(rr,si,si,0);
if(ko%2){
rep(i,res.size()){
rep(k,res.size()){
rep(m,res.size()){
rr[i][k]+=res[i][m]*en[m][k]%mo;
rr[i][k]%=mo;
}
}
}
return rr;
}
return res;
};

return dfs(dfs,n);
}


ll mod_pow(ll N,ll n){
if(n==0) return 1;
ll hh;
hh=n%2;
int tt=mod_pow(N,n/2);
if(hh==0)return tt%mo*tt%mo;
else {return tt%mo*tt%mo*N%mo;}
}


int main(){

//cout<<fixed<<setprecision(15);

lcin(h,w);
mf_graph<ll> graph(h+w+100);
v2d(gg,h,w,0); 
v1 rr(h);
v1 cc(w);
ll s=h+w+50;
ll t=h+w+50+1;
v1 sum(h,0);
ll sum11=0;

rep(i,h)rep(k,w){
cin>>gg[i][k];
sum[i]+=gg[i][k];
graph.add_edge(i,h+k,gg[i][k]);
}

rep(i,h){
cin>>rr[i];
sum11+=rr[i];
}
rep(i,w){
cin>>cc[i];
sum11+=cc[i];
}

rep(i,h){
graph.add_edge(s,i,sum[i]);
graph.add_edge(i,t,rr[i]);
}

rep(i,w){
graph.add_edge(s,h+i,0);
graph.add_edge(h+i,t,cc[i]);
}

eout(sum11-graph.flow(s,t));




}