#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")

#define rd() ({long _v=0,_c;while(_c=*rp++-48,_c>=0)_v=_v*10+_c;_v;})
#define rd_signed(v) ({int _v=0,_c,_s;_s=*rp=='-'&&++rp;while(_c=*rp++-48,_c>=0)_v=_v*10+_c;_s?-_v:_v;})
#define wt(v) {ulong _z=v;do*--wp=_z%10+48;while(_z/=10);}
#define rep(v,e) for(long v=0;v<e;++v)
#define rrep(v,e) for(long v=e;v--;)

typedef unsigned long ulong;

void radix_sort_aux(unsigned*a,unsigned*b,int n){
	int c[256];
	for(int i=0;i<256;++i){
		c[i]=0;
	}
	for(int i=0;i<n;++i){
		++c[a[i]&255];
	}
	int t=0;
	for(int i=256;i--;){
		int u=c[i];
		c[i]=t;
		t+=u;
	}
	for(int i=0;i<n;++i){
		b[c[a[i]&255]++]=a[i]>>8|a[i]<<24;
	}
}

void radix_sort(unsigned*a,int n){
	static unsigned b[500*500];
	radix_sort_aux(a,b,n);
	radix_sort_aux(b,a,n);
	radix_sort_aux(a,b,n);
	radix_sort_aux(b,a,n);
}

int c1[500*500],c2[250*500];

int main(){
	char*mmap();
	char*rp=mmap(0l,1l<<25,1,2,0,0ll);
	long n=rd();
	long k=rd();
	long b=0;
	rrep(i,(n*2)*(n*2+1)){
		b+=*rp++&1;
	}
	rep(y,n*2){
		rep(x,n){
			int c=rd_signed();
			c1[n*2*y+x]=c^1<<31;
		}
		rep(x,n){
			int c=rd_signed();
			c1[n*2*y+n+x]=c^1<<31;
			c2[n*y+n+~x]=c+c1[n*2*y+n+~x];
		}
	}
	radix_sort(c1,(n*2)*(n*2));
	long z=0;
	rep(i,b){
		z+=c1[i]^1<<31;
	}
	if(!(b&1)){
		radix_sort(c2,n*(n*2));
		b>>=1;
		rep(i,b){
			k+=c2[i]^1<<31;
		}
		z=z>=k?z:k;
	}
	char wbuf[64],*wp=wbuf+sizeof wbuf;
	wt(z<0?-z:z);
	if(z<0)*--wp='-';
	write(1,wp,wbuf+sizeof wbuf-wp);
	_exit(0);
}