#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a,b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout<<" "<<kbrni;cout<<endl
#define smap(m) cout<<#m<<":";each(kbrni,m)cout<<" {"<<kbrni.first<<":"<<kbrni.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int>P;

const int MAX_N = 105;

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n,m;
    cin >> n >> m;
    vector<vector<vector<int> > > vec(m,vector<vector<int> >(n,vector<int>(n,0)));
    rep(i,m){
        rep(j,n){
            rep(k,n){
                cin >> vec[i][j][k];
            }
        }
    }
    int mn = INF;
    rep(i,m){
        set<int> st[2*MAX_N];
        rep(j,n){
            rep(k,n){
                st[j].insert(vec[i][j][k]);
                st[n+j].insert(vec[i][k][j]);
            }
            st[2*n].insert(vec[i][j][j]);
            st[2*n+1].insert(vec[i][j][n-j-1]);
        }
        rep(id,2*n+2){
            for(int j=i+1;j<m;j++){
                int cnt = 0;
                rep(k,n){
                    rep(l,n){
                        if(st[id].count(vec[j][k][l]) >= 1){
                            cnt++;
                        }
                    }
                    mn = min(mn,2*n-cnt);
                    cnt = 0;
                    rep(l,n){
                        if(st[id].count(vec[j][l][k]) >= 1){
                            cnt++;
                        }
                    }
                    mn = min(mn,2*n-cnt);
                    cnt = 0;
                }
                rep(k,n){
                    if(st[id].count(vec[j][k][k]) >= 1){
                        cnt++;
                    }
                }
                mn = min(mn,2*n-cnt);
                cnt = 0;
                rep(k,n){
                    if(st[id].count(vec[j][k][n-k-1]) >= 1){
                        cnt++;
                    }
                }
                mn = min(mn,2*n-cnt);
            }
        }
    }
    cout << mn-1 << endl;
    return 0;
}