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

#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (n); ++(i))
#define repp(i, m, n) for (int (i) = (m); (i) < (n); ++(i))
#define dbg(x) cerr << #x << ": " << x << endl;
#define dbg2(x, y) cerr<<"("<<#x<<", "<<#y<<") = "<<"("<<x<<", "<<y<<")"<<endl;
#define dbg3(x, y, z) cerr<<"("<<#x<<", "<<#y<<", "<<#z<<") = "<<"("<<x<<", "<<y<<", "<<z<<")"<<endl;
#define dbgB(value, size) cerr<<#value<<": "<<bitset<size>(value) << endl;
#define line() cerr << "---------------" << endl;

const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const double PI = 3.14159265358979323846;

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }

template<typename T>
void print1(T begin, T end) {
	while (begin != end) {
		cerr << (*begin) << " ";
		*begin++;
	}
	cerr << endl;
}

template<typename T>
void print2(T Array, int height, int width) {
	for (int i = 0; i < height; i++) {
		for (int j = 0; j < width; j++) {
			cerr << " " << Array[i][j];
		}
		cerr << endl;
	}
}

void print() { std::cerr << endl; }
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
	std::cerr << head << " ";
	print(std::forward<Tail>(tail)...);
}

template<class T>
void Add(T &a, const T &b, const T &mod=1000000007) {
	int val = ((a % mod) + (b % mod)) % mod;
	if (val < 0) { val += mod; }
	a = val;
}

template <typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template <typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }

// ------------------------------------------------------------------------------------------

int N, C;
int D[555][555];
int c[555][555];
map<int, int> mp0, mp1, mp2;

int solve(int zero, int one, int two) {
	int ret = 0;
	for (auto x : mp0) {
		int num = x.first;
		int cnt = x.second;
		ret += D[num-1][zero-1] * cnt;
	}
	for (auto x : mp1) {
		int num = x.first;
		int cnt = x.second;
		ret += D[num-1][one-1] * cnt;
	}
	for (auto x : mp2) {
		int num = x.first;
		int cnt = x.second;
		ret += D[num-1][two-1] * cnt;
	}

	return ret;

	/*
	rep (i, N) {
		rep (j, N) {
			int I = i+1, J = j+1;
			if ((I+J)%3 == 0) {
				ret += D[c[i][j]-1][zero-1];
			}
			if ((I+J)%3 == 1) {
				ret += D[c[i][j]-1][one-1];
			}
			if ((I+J)%3 == 2) {
				ret += D[c[i][j]-1][two-1];
			}
		}
	}
	return ret;
	*/
}

signed main() {
	cin >> N >> C;
	rep (i, C) { rep (j, C) { cin >> D[i][j]; } }
	rep (i, N) { rep (j, N) { cin >> c[i][j];
			int I = i+1, J = j+1;
			if ((I+J)%3 == 0) {
				mp0[c[i][j]]++;
			}
			if ((I+J)%3 == 1) {
				mp1[c[i][j]]++;
			}
			if ((I+J)%3 == 2) {
				mp2[c[i][j]]++;
			}
	 } }

	int ans = 1e18;
	repp (c1, 1, C+1) {
		repp (c2, 1, C+1) {
			repp (c3, 1, C+1) {
				if (c1 == c2) continue;
				if (c1 == c3) continue;
				if (c2 == c3) continue;

				int t = solve(c1, c2, c3);
				chmin(ans, t);
				// dbg3(c1, c2, c3)
				// dbg(t)
				// line()
			}
		}
	}

	cout << ans << endl;

	return 0;
}

Measured memory_bytes: 4352