#include<cstdio>
#include<cstring>
#include<iostream>
#define m(s) memset(s,0,sizeof s)
#define inf 0x7ffffff
#define IN inline 
#define R register 
using namespace std;
const int N=305;
IN int read(){
    R int x=0;R bool f=1;
    R char ch=getchar();
    while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=0;ch=getchar();}
    while(ch>=‘0‘&&ch<=‘9‘){x=(x<<3)+(x<<1)+ch-‘0‘;ch=getchar();}
    return f?x:-x;
}
struct node{
    int v,cap,cost,next;
}e[N*100];
int n,m,S,T,tot,ans,head[N],prep[N],prev[N],flow[N],dis[N];
int a[N],b[N],c[N][N];
bool vis[N];
IN void add(int x,int y,int cap,int cost){
    e[++tot].v=y;
    e[tot].cap=cap;
    e[tot].cost=cost;
    e[tot].next=head[x];
    head[x]=tot;
}
IN void build(){
    S=0,T=m+n+1;
    for(int i=1;i<=m;i++) add(S,i,a[i],0),add(i,S,0,0);
    for(int i=1;i<=n;i++) add(i+m,T,b[i],0),add(T,i+m,0,0);
    for(int i=1;i<=m;i++){
        for(int j=1;j<=n;j++){
            add(i,j+m,inf,c[i][j]);add(j+m,i,0,-c[i][j]);
        }
    }
}
IN void Cl(){
    ans=0;
    m(head);m(prep);m(prev);m(flow);
}
const int QLEN=N*100;
int q[QLEN+5];
IN bool spfa(int k){
    int h=0,t=1;m(vis);
    if(k>0) memset(dis,127,sizeof dis);
    else memset(dis,128,sizeof dis);
    q[t]=S;dis[S]=0;vis[S]=1;
    flow[S]=inf;prep[S]=-1;
    while(h!=t){
        if(++h>QLEN) h=1;
        int x=q[h];
        vis[x]=0;
        for(int i=head[x];i;i=e[i].next){
            int v=e[i].v,cap=e[i].cap,cost=e[i].cost;
            if(cap>0&&((k>0&&dis[v]>dis[x]+cost)||(k<0&&dis[v]<dis[x]+cost))){
                dis[v]=dis[x]+cost;
                prep[v]=x;prev[v]=i;
                flow[v]=min(flow[x],cap);
                if(!vis[v]){
                    vis[v]=1;
                    if(++t>QLEN) t=1;
                    q[t]=v;
                }
            }
        }
    }
    if(k>0) return dis[T]<inf;
    else return dis[T]>0;
}
IN void work(){
    for(int i=T;i!=S;i=prep[i]){
        e[prev[i]].cap-=flow[T];
        e[prev[i]^1].cap+=flow[T];
    }
    ans+=flow[T]*dis[T];
}
int main(){
    freopen("tran.in","r",stdin);
    freopen("tran.out","w",stdout);
    m=read();n=read();
    for(int i=1;i<=m;i++) a[i]=read();
    for(int i=1;i<=n;i++) b[i]=read();
    for(int i=1;i<=m;i++){
        for(int j=1;j<=n;j++){
            c[i][j]=read();
        }
    }
    tot=1;build();
    while(spfa(1)) work();
    printf("%d\n",ans);
    tot=1;Cl();build();
    while(spfa(-1)) work();
    printf("%d\n",ans);
    return 0;
}