#include<iostream>
using namespace std;
//Minimum Cost Flow O(FE log V)
#include<algorithm>
#include<utility>
#include<vector>
#include<queue>
#include<limits>
template<typename T>
struct MCF{
	struct edge{
		int to,rev,cap;
		T cost;
	};
	vector<vector<edge> >G;
	vector<T>h,d;
	vector<int>pv,pe;
	MCF(int n_=0):G(n_),h(n_,0),d(n_),pv(n_),pe(n_){}
	void add_edge(int from,int to,int cap,T cost)
	{
		G[from].push_back({to,(int)G[to].size(),cap,cost});
		G[to].push_back({from,(int)G[from].size()-1,0,-cost});
	}
	T min_cost_flow(int s,int t,int f)//ans or -1
	{
		T ret=0;
		bool fst=true;
		while(f>0)
		{
			fill(d.begin(),d.end(),numeric_limits<T>::max());
			d[s]=0;
			if(fst)
			{
				fst=false;
				while(true)
				{
					bool ch=false;
					for(int i=0;i<G.size();i++)if(d[i]<numeric_limits<T>::max())
					{
						for(int j=0;j<G[i].size();j++)
						{
							edge&e=G[i][j];
							if(e.cap>0&&d[e.to]>d[i]+e.cost)
							{
								d[e.to]=d[i]+e.cost;
								pv[e.to]=i;
								pe[e.to]=j;
								ch=true;
							}
						}
					}
					if(!ch)break;
				}
			}
			else
			{
				priority_queue<pair<T,int>,vector<pair<T,int> >,greater<pair<T,int> > >P;
				P.push(make_pair(0,s));
				while(!P.empty())
				{
					pair<T,int>p=P.top();P.pop();
					if(d[p.second]<p.first)continue;
					for(int i=0;i<G[p.second].size();i++)
					{
						edge&e=G[p.second][i];
						if(e.cap>0&&d[e.to]>d[p.second]+e.cost+h[p.second]-h[e.to])
						{
							d[e.to]=d[p.second]+e.cost+h[p.second]-h[e.to];
							pv[e.to]=p.second;
							pe[e.to]=i;
							P.push(make_pair(d[e.to],e.to));
						}
					}
				}
			}
			if(d[t]==numeric_limits<T>::max())return -1;
			for(int u=0;u<G.size();u++)h[u]+=d[u];
			int d=f;
			for(int u=t;u!=s;u=pv[u])d=min(d,G[pv[u]][pe[u]].cap);
			f-=d;
			ret+=d*h[t];
			for(int u=t;u!=s;u=pv[u])
			{
				G[pv[u]][pe[u]].cap-=d;
				G[u][G[pv[u]][pe[u]].rev].cap+=d;
			}
		}
		return ret;
	}
};
int N,K;
int A[200],B[200];
int P[200][200];
int ans=0;
main()
{
	cin>>N>>K;
	for(int i=0;i<N;i++)cin>>A[i];
	for(int i=0;i<N;i++)cin>>B[i];
	for(int i=0;i<N;i++)for(int j=0;j<N;j++)
	{
		cin>>P[i][j];
		ans+=P[i][j]*P[i][j];
	}
	MCF<int>Q(N*N+2*N+2);
	int st=N*N+2*N,go=st+1;
	for(int i=0;i<N;i++)
	{
		Q.add_edge(st,N*N+i,A[i],0);
		Q.add_edge(N*N+N+i,go,B[i],0);
	}
	for(int i=0;i<N;i++)for(int j=0;j<N;j++)
	{
		Q.add_edge(N*N+i,i*N+j,K,-2*P[i][j]);
		for(int k=0;k<A[i];k++)Q.add_edge(i*N+j,N*N+N+j,1,2*k+1);
	}
	cout<<ans+Q.min_cost_flow(st,go,K)<<endl;
}