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

#define _p(...) (void)printf(__VA_ARGS__)
#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define bit(n) (1LL<<(n))
#define sz(x) ((int)(x).size())
#define fst first
#define snd second
using ll=long long;using pii=pair<int,int>;
using vb=vector<bool>;using vs=vector<string>;
using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;
using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;
using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;
template<typename T>T read(){T t;cin>>t;return t;}
template<class T,class U>ostream&operator<<(ostream&o,const pair<T,U>&p){o<<'('<<p.fst<<", "<<p.snd<<')';return o;}

int common(const vi &A, const vi &B) {
  const int n = sz(A);
  int i = 0, j = 0;
  int ret = 0;
  while (i < n && j < n) {
    if (A[i] == B[j]) {
      ret++;
      i++;
      j++;
    }
    else if (A[i] < B[j]) {
      i++;
    }
    else if (A[i] > B[j]) {
      j++;
    }
  }
  return ret;
}

int solve() {
  int n = read<int>();
  int m = read<int>();

  vvvi C(m);

  rep(i, m) {
    vvi c(n, vi(n));
    rep(y, n) {
      rep(x, n) {
        c[y][x] = read<int>();
      }
    }

    rep(y, n) {
      vi b(n);
      rep(x, n) b[x] = c[y][x];
      sort(all(b));
      C[i].push_back(b);
    }
    rep(x, n) {
      vi b(n);
      rep(y, n) b[y] = c[y][x];
      sort(all(b));
      C[i].push_back(b);
    }
    {
      vi b(n);
      rep(j, n) b[j] = c[j][j];
      sort(all(b));
      C[i].push_back(b);
    }
    {
      vi b(n);
      rep(j, n) b[j] = c[j][n-1-j];
      sort(all(b));
      C[i].push_back(b);
    }
  }

  int match = 0;
  rep(i, m) rep(j, i+1, m) {
    forr(bi, C[i]) forr(bj, C[j]) {
      int cand = common(bi, bj);
      match = max(match, cand);
    }
  }
  return 2 * n - 1 - match;
}

void Main() {
  cout << solve() << endl;
}
int main() { cin.tie(nullptr); ios::sync_with_stdio(false); Main(); return 0; }