#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
//#define int long long
using bll = boost::multiprecision::cpp_int;
using ll = long long;
//constexpr int INF = 1e9;//INT_MAX=(1<<31)-1=2147483647
constexpr ll INF = (ll)1e18;//(1LL<<63)-1=9223372036854775807
constexpr ll MOD = (ll)1e9 + 7;
constexpr double EPS = 1e-9;
constexpr int dx[4]={1,0,-1,0};
constexpr int dy[4]={0,1,0,-1};
#define p(var) std::cout<<var<<std::endl
#define PI (acos(-1))
#define rep(i, n)   for(ll i=0, i##_length=(n); i< i##_length; ++i)
#define repeq(i, n) for(ll i=1, i##_length=(n); i<=i##_length; ++i)
#define all(v) (v).begin(), (v).end()
#define uniq(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
template<typename T> inline void pv(vector<T> v) { for(ll i=0, N=v.size(); i<N; i++) cout<< v[i] << (i==N-1 ? '\n' : ' '); }
template<typename T> inline T gcd(T a, T b) { return b ? gcd(b,a%b) : a; }
template<typename T> inline T lcm(T a, T b) { return a / gcd(a,  b) * b; }
template<typename T1, typename T2> inline T1 power(T1 x, T2 n){ return n ? power(x*x%MOD,n/2)*(n%2?x:1)%MOD : 1; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
template<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& p) {return s << "(" << p.first << ", " << p.second << ")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
	for (int i = 0, len = v.size(); i < len; ++i){ s << v[i]; if (i < len - 1) s << "\t"; } return s; }
template<typename T> ostream& operator<<(ostream& s, const vector< vector<T> >& vv) {
	for (int i = 0, len = vv.size(); i < len; ++i){ s << vv[i] << endl; } return s; }
template<typename T1, typename T2> ostream& operator<<(ostream& s, const map<T1, T2>& m) {
	s << "{" << endl; for (auto itr = m.begin(); itr != m.end(); ++itr){ s << "\t" << (*itr).first << " : " << (*itr).second << endl; } s << "}" << endl; return s; }
template<typename T> ostream& operator<<(ostream& s, const set<T>& se) {
	s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}" << endl; return s; }
template<typename T> ostream& operator<<(ostream& s, const multiset<T>& se) {
	s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}" << endl; return s; }
#ifdef LOCAL_DEV
	#define debug(var) std::cout<<#var" = "<<var<<std::endl
#else
	#define debug(var)
#endif
#ifdef LOCAL_TEST
	namespace std {
		template<typename T> class dvector : public std::vector<T> {
		public:
			dvector() : std::vector<T>() {}
			explicit dvector(size_t n, const T& value = T()) : std::vector<T>(n,value) {}
			dvector(const std::vector<T>& v) : std::vector<T>(v) {}
			T& operator[](size_t n){ return this->at(n); }
		};
	};
	#define vector dvector
#endif

/*-----8<-----8<-----*/

signed main() {

	ll N,C,t;
	cin>>N>>C;
	vector<vector<ll>> d(C,vector<ll>(C,0));
	rep(i,C)rep(j,C){
		cin>>d[i][j];
	}
	vector<vector<ll>> c(N,vector<ll>(N,0));;
	rep(i,N)rep(j,N){
		cin>>t;
		c[i][j]=t-1;
	}

	vector<vector<ll>> a(3,vector<ll>(C,0));

	rep(i,N)rep(j,N){
		a[(i+j)%3][c[i][j]]++;
	}

	vector<vector<ll>> r(3,vector<ll>(C,0));

	rep(i,3 )rep(j,C) rep(k,C){
		if(k != j)
			r[i][j]+=d[k][j]* a[i][k];
	}

	vector<vector<pair<ll,ll>>> rank(3,vector<pair<ll,ll>>(C,pair<ll,ll>()));
	rep(i,3 )rep(j,C) {
		rank[i][j].first=r[i][j];
		rank[i][j].second=j;
	}

	rep(i,3 ){
		sort(all(rank[i]));
	}

	vector<ll>ans;

	rep(i,3 ) rep(j,3 ) rep(k,3 ){
		if(rank[0][i].second== rank[1][j].second)continue;
		if(rank[0][i].second== rank[2][k].second)continue;
		if(rank[1][j].second== rank[2][k].second)continue;
		t=rank[0][i].first+ rank[1][j].first+ rank[2][k].first;
		ans.push_back(t);
	}
	sort(all(ans));
	p(ans[0]);


	return 0;
}


Measured memory_bytes: 2176