#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	int N; int M;
	while(~scanf("%d%d", &N, &M)) {
		vector<vector<vi>> players(M);
		rep(k, M) {
			vector<vector<int> > C(N, vector<int>(N));
			for(int i = 0; i < N; ++ i) for(int j = 0; j < N; ++ j)
				scanf("%d", &C[i][j]);
			vector<vi> &bingos = players[k];
			rep(i, N) {
				bingos.push_back(vi());
				rep(j, N)
					bingos.back().push_back(C[i][j]);
			}
			rep(j, N) {
				bingos.push_back(vi());
				rep(i, N)
					bingos.back().push_back(C[i][j]);
			}
			bingos.push_back(vi());
			rep(i, N)
				bingos.back().push_back(C[i][i]);
			bingos.push_back(vi());
			rep(i, N)
				bingos.back().push_back(C[i][N - 1 - i]);
			for(auto &v : bingos)
				sort(v.begin(), v.end());
		}
		vector<bool> mark(N * N * M + 1);
		int ans = INF;
		rep(i, M) {
			for(const auto &v : players[i]) {
				for(int x : v)
					mark[x] = true;
				reu(j, i + 1, M) for(const auto &w : players[j]) {
					int cost = (int)w.size();
					for(int x : w)
						cost += !mark[x];
					amin(ans, cost - 1);
				}
				for(int x : v)
					mark[x] = false;
			}
		}
		printf("%d\n", ans);
	}
	return 0;
}