#include<bits/stdc++.h>
using namespace std;
constexpr int N=35005,B=405;
typedef long long ll;
int n,id[N],a[N][7],k;
ll dp[N][B*2+1];
int main(){
    cin>>n>>k;
    for(int i=1;i<=n;i++)
    for(int j=0;j<=2*k;j++) cin>>a[i][j];
    for(int i=1;i<=n;i++) id[i]=i;
    mt19937 rnd(time(0));
    shuffle(id+1,id+n+1,rnd);
    memset(dp,0x3f,sizeof dp);
    int b=B-5;
    dp[0][B]=0;
    for(int i=1;i<=n;i++)
    for(int j=-b;j<=b;j++){
        for(int l=-k;l<=k;l++)
            dp[i][j+B]=min(dp[i][j+B],dp[i-1][j-l+B]+a[id[i]][l+k]);
    }
    cout<<dp[n][B]<<'\n';
}