#include<bits/stdc++.h>
using namespace std;

typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int,int> pii;
typedef priority_queue< int, vector< int >, greater< int > >  minHeap;

#define ones(x) __builtin_popcount(x)
#define onesl(x) __builtin_popcountl(x)
#define onesll(x) __builtin_popcountll(x)

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define scn(n) scanf("%d",&n)
#define scnll(n) scanf("%lld",&n)
#define scn2(n,m) scanf("%d%d",&n,&m)
#define scn3(n,m,w) scanf("%d%d%d",&n,&m,&w)
#define scn2ll(n,m) scanf("%lld%lld",&n,&m)
#define atoz(v) v.begin(),v.end()
#define ratoz(v) v.rbegin(),v.rend()
#define Fill(a,v) memset(a,v,sizeof(a))
#define fi first
#define se second
#define inf 1e9
#define pi acos(-1.0)
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define mod 1000000007
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define bug(x) cerr << __LINE__ << " says: " << #x << " = " << (x) << "\n"

int Set(int N,int pos)
{
    return N=N | (1<<pos);
}
int reset(int N,int pos)
{
    return N = N & ~(1<<pos);
}
bool check(int N,int pos)
{
    return (bool)(N & (1<<pos));
}

inline int addmod(lli x,lli y)
{
    return (x%mod + y%mod)%mod;
}
inline int submod(lli x,lli y)
{
    return (x%mod - y%mod + mod)%mod;
}
inline int mulmod(lli x,lli y)
{
    return (x%mod * y%mod)%mod;
}

inline int nextSubMask(int i, int mask)
{
    return (i-1)&mask;   /// returns next  submask
}

template<typename T>
void we_r_done(T mssg)
{
    cout<<mssg;
    exit(0);
}



int main()
{
    ///freopen("output.txt","w",stdout);
   // freopen("input.txt","r",stdin);

    FastIO;
    int n,c;

    while(cin>>n>>c){
        int D[c+1][c+1];
        for(int i=1; i<=c; i++){
            for(int j=1; j<=c; j++){
                cin>>D[i][j];
            }
        }
        int color[n+1][n+1];
        vector<int>v[3];
        for(int i=1; i<=n; i++){
            for(int j=1; j<=n; j++){
                cin>>color[i][j];
                v[(i+j)%3].pb(color[i][j]);
            }
        }

        lli cost[3][c+1];

        for(int i=0; i<3; i++){

            for(int c1=1; c1<=c; c1++){

                cost[i][c1] = 0;
                lli now = 0;
                for(int cnow : v[i]) now += D[cnow][c1];
                cost[i][c1] = now;
            }
        }

        lli ans = 1e18;
        for(int c1=1; c1<=c ; c1++){
            for(int c2=c1+1; c2<=c; c2++){
                for(int c3=c2+1; c3<=c; c3++){

                    vector<int>col;
                    col = {c1,c2,c3};
                    sort(atoz(col));
                    do{
                        lli now = 0;
                        for(int i=0; i<col.size(); i++){

                            now += cost[i][col[i]];
                        }
                        ans = min(ans , now);
                    }while(next_permutation(atoz(col)));
                }
            }
        }
        cout<<ans<<endl;
    }

    return 0;

}

///sin and cos expect input in radians not degrees. so use , sin(degrees * pi / 180)
///using bs = bitset<MX>; // how many distinct number can be form?
///sort(atoz(v), [](const data x, const data y){return (x.a==y.a?x.b>y.b : x.a<y.a);});


Measured memory_bytes: 2544