#include <bits/stdc++.h>
#ifdef __LOCAL
    #define DBG(X) cout << #X << " = " << (X) << endl;
    #define SAY(X) cout << (X) << endl;
#else
    #define DBG(X)
    #define SAY(X)
#endif

#ifdef __LOCAL
    #include <filesystem>
    namespace fs = std::filesystem;
#endif

using namespace std;

using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

int dx[]={1, 0, -1, 0, 1,-1, 1,-1};
int dy[]={0, 1, 0, -1, 1, 1,-1,-1};
const int INT_INF = (int)(2e9);
const ll  LL_INF = (ll)(2e18);
static mt19937 _g(time(nullptr));
 
inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const map<T, S> p) { for (auto el : p) cout << "[" << el.first << ";" << el.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for (auto el : v) cout << el << " "; return os; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for (auto& elem : ret) cin >> elem; return ret; }

int N,Cnum;
vector<vector<int>> D,C;
vector<vector<int>> Cnt;
void input(){
    fast_io();
    #ifdef __LOCAL
        fs::path p = __FILE__;
        fs::path input,output;
        input = output = p.parent_path();
        input += string("/input/") + string(p.stem()) + string(".txt");
        output += string("/output/") + string(p.stem()) + string(".txt");
        freopen(input.c_str(), "r", stdin);
        freopen(output.c_str(), "w", stdout);
    #endif
    cin >> N >> Cnum;
    D.assign(Cnum,vector<int>(Cnum,0));
    C.assign(N,vector<int>(N,0));
    Cnt.assign(3,vector<int>(Cnum,0));
    for (int i = 0; i < Cnum; i++) for (int j = 0; j < Cnum; j++) cin >> D[i][j];
    for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) {cin >> C[i][j]; C[i][j]--; Cnt[(i+j)%3][C[i][j]]++; }
    
}

vector<vector<int>> makeGrid(int a, int b, int c){
    vector<vector<int>> res(N,vector<int>(N,0));
    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j < N; j++)
        {
            if((i+j)%3==0) res[i][j]=a;
            if((i+j)%3==1) res[i][j]=b;
            if((i+j)%3==2) res[i][j]=c;
        }
    }
    return res;

}

void DBGMat(vector<vector<int>> mat){
    #ifdef __LOCAL
    int n=mat.size();
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            cout << mat[i][j] << " ";
        }
        cout << "\n";
    }
    #endif
}

ll TLEcalScore(vector<vector<int>> mat){
    ll res=0;
    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j < N; j++)
        {
            res += D[C[i][j]][mat[i][j]];
        }
        
    }
    return res;
    
}

ll calScore(int a, int b, int c){
    ll res=0;
    for (int i = 0; i < Cnum; i++)
    {
        res += D[i][a]*Cnt[0][i];
        res += D[i][b]*Cnt[1][i];
        res += D[i][c]*Cnt[2][i];
    }
    return res;
    
}

// 愚直に全パターン探索した場合。
// 普通に間に合わない。O(cP3*N^2)
int solve(){
    ll ans=LL_INF;
    vector<bool> v(Cnum,false);
    fill(v.begin(),v.begin()+3,true);
    do
    {
        vector<int> abc;
        for (int i = 0; i < Cnum; i++) if(v[i]) abc.push_back(i);
        do
        {
            // auto a=makeGrid(abc[0],abc[1],abc[2]);
            ll a = calScore(abc[0],abc[1],abc[2]);
            ans = min(ans,a);
        } while (next_permutation(abc.begin(),abc.end()));
    } while (prev_permutation(v.begin(),v.end()));    
    cout << ans << endl;
    return 0;
}   

int test(){
    vector<bool> v(N,false);
    fill(v.begin(),v.begin()+3,true);
    do
    {
        DBG(v)
    } while (prev_permutation(v.begin(),v.end()));
    
    return 0;
}

int main()
{
    input();
    solve();
    // test();
    return 0;
}


Measured memory_bytes: 1280