1 //It is made by jump~
  2 #include <iostream>
  3 #include <cstdlib>
  4 #include <cstring>
  5 #include <cstdio>
  6 #include <cmath>
  7 #include <algorithm>
  8 #include <ctime>
  9 #include <vector>
 10 #include <queue>
 11 #include <map>
 12 #ifdef WIN32
 13 #define OT "%I64d"
 14 #else
 15 #define OT "%lld"
 16 #endif
 17 using namespace std;
 18 typedef long long LL;
 19 const int MAXN = 60;
 20 const int MAXD = 5011;
 21 const int MAXM = 100011;
 22 const int inf = 2000000000;
 23 int n,k;
 24 int a[MAXN][MAXN];
 25 int first[MAXD],dis[MAXD];
 26 bool pd[MAXD];
 27 int pre[MAXD];
 28 int ecnt=1;
 29 int s,t;
 30 int ans;
 31 queue<int>Q;
 32
 33 struct edge{
 34     int to,f,next,u;
 35     int w;
 36 }e[MAXM];
 37
 38 inline int getint()
 39 {
 40     int w=0,q=0;
 41     char c=getchar();
 42     while((c<'0' || c>'9') && c!='-') c=getchar();
 43     if (c=='-')  q=1, c=getchar();
 44     while (c>='0' && c<='9') w=w*10+c-'0', c=getchar();
 45     return q ? -w : w;
 46 }
 47
 48 inline void link(int x,int y,int w,int z){
 49     e[++ecnt].next=first[x]; first[x]=ecnt; e[ecnt].to=y; e[ecnt].f=z; e[ecnt].w=w; e[ecnt].u=x;
 50     e[++ecnt].next=first[y]; first[y]=ecnt; e[ecnt].to=x; e[ecnt].f=0; e[ecnt].w=-w; e[ecnt].u=y;
 51 }
 52
 53 inline int spfa(){//EK
 54     //根据边权跑最短路
 55     while(!Q.empty()) Q.pop();
 56     memset(pd,0,sizeof(pd));
 57     //memset(pre,0,sizeof(pre));
 58     //memset(flow,0,sizeof(flow));
 59     for(int i=0;i<=t;i++) dis[i]=inf,pre[i]=-1;
 60     pd[s]=1; Q.push(s); dis[s]=0;
 61     while(!Q.empty()){
 62     int u=Q.front(); Q.pop(); pd[u]=0;
 63     //if(u==t) break;
 64     for(int i=first[u];i;i=e[i].next) {
 65         if(e[i].f>0) {
 66         int v=e[i].to;
 67         if(dis[v]>dis[u]+e[i].w) {//限制流
 68             dis[v]=dis[u]+e[i].w;
 69             pre[v]=i;
 70             if(!pd[v]) { Q.push(v); pd[v]=1; }
 71         }
 72         }
 73     }
 74     }
 75     if(dis[t]==inf) return -1;
 76     return 1;
 77 }
 78
 79 inline int update(){
 80     int total=0; int f=inf;
 81     for(int i=pre[t];e[i].u!=s;i=pre[e[i].u]) f=min(f,e[i].f);
 82
 83     for(int i=pre[t];e[i].u!=s;i=pre[e[i].u]){
 84     total+=e[i].w*f;
 85     e[i].f-=f;
 86     e[i^1].f+=f;
 87     }
 88
 89     return total;
 90 }
 91
 92 inline void solve(){
 93     while(scanf("%d%d",&n,&k)!=EOF) {
 94     for(int i=1;i<=n;i++) for(int j=1;j<=n;j++)  a[i][j]=getint();
 95     ecnt=1;
 96     memset(first,0,sizeof(first));
 97     for(int i=1;i<=n;i++)
 98         for(int j=1;j<=n;j++) {
 99         int now=(i-1)*n+j-1;
100         link(now*2,now*2+1,-a[i][j],1); link(now*2,now*2+1,0,k-1);//拆成两个点，并且连边
101         }
102
103     for(int i=1;i<=n;i++) //向右连边
104         for(int j=1;j<n;j++) {//最后一列无需连边
105         int now=(i-1)*n+j-1;
106         link(now*2+1,now*2+2,0,k);
107         }
108
109     for(int i=1;i<n;i++) //向下连边
110         for(int j=1;j<=n;j++) {//最后一行无需连边
111         int now=(i-1)*n+j-1;
112         link(now*2+1,(now+n)*2,0,k);
113         }
114
115     s=n*n*2; t=s+1;
116     link(s,0,0,k); link(s-1,t,0,k);
117
118     ans=0;
119     while(1) {
120         int daan=spfa();
121         if(daan==-1) break;
122         ans+=update();
123     }
124     printf("%d\n",-ans);
125     }
126
127 }
128
129 int main()
130 {
131     solve();
132     return 0;
133 }