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

typedef vector<int> v1;
typedef vector<v1> v2;
typedef vector<v2> v3;

// #define getchar getchar_unlocked

int in() {
	int n, c;
	while ((c = getchar()) < '0') {
		assert(c != EOF);
	}
	n = c - '0';
	while ((c = getchar()) >= '0') {
		n = n * 10 + c - '0';
	}
	return n;
}

void iterate(v3 &c, int k, function<void(v1 &)> f) {
	int n = c[0].size();
	v2 &a = c[k];
	vector<int> v(n);
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			v[j] = a[i][j];
		}
		f(v);
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			v[j] = a[j][i];
		}
		f(v);
	}
	for (int i = 0; i < n; i++) {
		v[i] = a[i][i];
	}
	f(v);
	for (int i = 0; i < n; i++) {
		v[i] = a[n - 1 - i][i];
	}
	f(v);
}

int main() {
	int n = in(), m = in();
	v3 c(m, v2(n, v1(n)));
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < n; j++) {
			for (int k = 0; k < n; k++) {
				c[i][j][k] = in();
			}
		}
	}
	int ans = INT_MAX;
	vector<int> buf(2 * n);
	vector<bool> used(100000);
	for (int i = 0; i < m; i++) {
		for (int j = i + 1; j < m; j++) {
			iterate(c, i, [&](v1 &x) {
				iterate(c, j, [&](v1 &y) {
					int cnt = 0;
					for (int e : x) {
						if (!used[e]) {
							cnt++;
						}
						used[e] = true;
					}
					for (int e : y) {
						if (!used[e]) {
							cnt++;
						}
						used[e] = true;
					}
					for (int e : x) {
						used[e] = false;
					}
					for (int e : y) {
						used[e] = false;
					}
					ans = min(ans, cnt - 1);
				});
			});
		}
	}
	cout << ans << endl;
}