import java.io.*; import java.util.*; public class Main_yukicoder452 { private static Scanner sc; private static Printer pr; private static void solve() { int n = sc.nextInt(); int m = sc.nextInt(); c = new int[m][n * 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 * n + k] = sc.nextInt(); } } } hm = new ArrayList<>(); for (int i = 0; i < m; i++) { Map tmp = new HashMap<>(); hm.add(tmp); for (int j = 0; j < n * n; j++) { tmp.put(c[i][j], j); } } int ret = 2 * n; for (int i = 0; i < m; i++) { for (int j = i + 1; j < m; j++) { ret = Math.min(ret, f(i, j, n)); } } pr.println(ret); } private static int[][] c; private static List> hm; private static int f(int c1, int c2, int n) { int ret = 0; for (int i = 0; i < n; i++) { List al = new ArrayList<>(); for (int j = 0; j < n; j++) { al.add(c[c1][i * n + j]); } ret = Math.max(ret, f2(c2, al, n)); } for (int i = 0; i < n; i++) { List al = new ArrayList<>(); for (int j = 0; j < n; j++) { al.add(c[c1][j * n + i]); } ret = Math.max(ret, f2(c2, al, n)); } { List al = new ArrayList<>(); List al2 = new ArrayList<>(); for (int i = 0; i < n; i++) { al.add(c[c1][i * n + i]); al2.add(c[c1][(n - 1 - i) * n + i]); } ret = Math.max(ret, f2(c2, al, n)); ret = Math.max(ret, f2(c2, al2, n)); } for (int i = 0; i < n; i++) { List al = new ArrayList<>(); for (int j = 0; j < n; j++) { al.add(c[c2][i * n + j]); } ret = Math.max(ret, f2(c1, al, n)); } for (int i = 0; i < n; i++) { List al = new ArrayList<>(); for (int j = 0; j < n; j++) { al.add(c[c2][j * n + i]); } ret = Math.max(ret, f2(c1, al, n)); } { List al = new ArrayList<>(); List al2 = new ArrayList<>(); for (int i = 0; i < n; i++) { al.add(c[c2][i * n + i]); al2.add(c[c2][(n - 1 - i) * n + i]); } ret = Math.max(ret, f2(c1, al, n)); ret = Math.max(ret, f2(c1, al2, n)); } // if (ret == 4) { // return 3; // } else if (ret == 3) { // return 4; // } else if (ret == 2) { // return 4 + 1; // } else { // return 4 + 2; // } return n - 1 + (n - ret); } private static int f2(int c1, List al, int n) { int[] bx = new int[n]; int[] by = new int[n]; int b1 = 0; int b2 = 0; int max = 0; for (int e : al) { Integer ii = hm.get(c1).get(e); if (ii != null) { int i = ii.intValue(); int x = i % n; int y = i / n; bx[x]++; by[y]++; if (x == y) { b1++; } if (n - 1 - y == x) { b2++; } max = Math.max(max, bx[x]); max = Math.max(max, by[y]); max = Math.max(max, b1); max = Math.max(max, b2); } } return max; } // --------------------------------------------------- public static void main(String[] args) { sc = new Scanner(System.in); pr = new Printer(System.out); solve(); pr.close(); sc.close(); } @SuppressWarnings("unused") private static class Scanner { BufferedReader br; Scanner (InputStream in) { br = new BufferedReader(new InputStreamReader(in)); } private boolean isPrintable(int ch) { return ch >= '!' && ch <= '~'; } private boolean isCRLF(int ch) { return ch == '\n' || ch == '\r' || ch == -1; } private int nextPrintable() { try { int ch; while (!isPrintable(ch = br.read())) { if (ch == -1) { throw new NoSuchElementException(); } } return ch; } catch (IOException e) { throw new NoSuchElementException(); } } String next() { try { int ch = nextPrintable(); StringBuilder sb = new StringBuilder(); do { sb.appendCodePoint(ch); } while (isPrintable(ch = br.read())); return sb.toString(); } catch (IOException e) { throw new NoSuchElementException(); } } int nextInt() { try { // parseInt from Integer.parseInt() boolean negative = false; int res = 0; int limit = -Integer.MAX_VALUE; int radix = 10; int fc = nextPrintable(); if (fc < '0') { if (fc == '-') { negative = true; limit = Integer.MIN_VALUE; } else if (fc != '+') { throw new NumberFormatException(); } fc = br.read(); } int multmin = limit / radix; int ch = fc; do { int digit = ch - '0'; if (digit < 0 || digit >= radix) { throw new NumberFormatException(); } if (res < multmin) { throw new NumberFormatException(); } res *= radix; if (res < limit + digit) { throw new NumberFormatException(); } res -= digit; } while (isPrintable(ch = br.read())); return negative ? res : -res; } catch (IOException e) { throw new NoSuchElementException(); } } long nextLong() { try { // parseLong from Long.parseLong() boolean negative = false; long res = 0; long limit = -Long.MAX_VALUE; int radix = 10; int fc = nextPrintable(); if (fc < '0') { if (fc == '-') { negative = true; limit = Long.MIN_VALUE; } else if (fc != '+') { throw new NumberFormatException(); } fc = br.read(); } long multmin = limit / radix; int ch = fc; do { int digit = ch - '0'; if (digit < 0 || digit >= radix) { throw new NumberFormatException(); } if (res < multmin) { throw new NumberFormatException(); } res *= radix; if (res < limit + digit) { throw new NumberFormatException(); } res -= digit; } while (isPrintable(ch = br.read())); return negative ? res : -res; } catch (IOException e) { throw new NoSuchElementException(); } } float nextFloat() { return Float.parseFloat(next()); } double nextDouble() { return Double.parseDouble(next()); } String nextLine() { try { int ch; while (isCRLF(ch = br.read())) { if (ch == -1) { throw new NoSuchElementException(); } } StringBuilder sb = new StringBuilder(); do { sb.appendCodePoint(ch); } while (!isCRLF(ch = br.read())); return sb.toString(); } catch (IOException e) { throw new NoSuchElementException(); } } void close() { try { br.close(); } catch (IOException e) { // throw new NoSuchElementException(); } } } private static class Printer extends PrintWriter { Printer(PrintStream out) { super(out); } } }