#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector < int > vi ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

const int MAXN = 4e4 + 7 ;
const int lim = 102 ;
const ll inf = 1e18 ;

int n , k ;

int perm[ MAXN ] ;
int vals[ MAXN ][ 8 ] ;
ll dp[ 2 ][ 2 * lim ] ;

void solve ( ) {
    cin >> n >> k ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        for ( int j = 1 ; j <= 2 * k + 1 ; ++ j ) {
            cin >> vals[ i ][ j ] ;
        }
        perm[ i ] = i ;
    }
    random_shuffle ( perm + 1 , perm + n + 1 ) ;
    int prv = 0 , nxt = 1 ;
    for ( int i = 0 ; i < 2 * lim ; ++ i ) {
        dp[ prv ][ i ] = dp[ nxt ][ i ] = inf ;
    }
    dp[ prv ][ lim ] = 0 ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        for ( int x = -k ; x <= k ; ++ x ) {
            int add = vals[ perm[ i ] ][ x + k + 1 ] ;
            for ( int j = 0 ; j < 2 * lim ; ++ j ) {
                if ( j + x < 0 || j + x >= 2 * lim ) { continue ; }
                dp[ nxt ][ j + x ] = min ( dp[ nxt ][ j + x ] , dp[ prv ][ j ] + add ) ;
            }
        }
        for ( int j = 0 ; j < 2 * lim ; ++ j ) {
            dp[ prv ][ j ] = inf ;
        }
        prv ^= 1 , nxt ^= 1 ;
    }
    cout << dp[ prv ][ lim ] << "\n" ;
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; // cin >> t ;
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}