#include <bits/stdc++.h>
using namespace std;
const int N=110,M=210;
int n,m,c[M][N][N],p,ans;
struct T{
    int a[N],id;
    void so(){sort(a+1,a+n+1);}
}t[2*N*M];
bool cmp(T x,T y){
    for (int i=1;i<=n;i++){
        if(x.a[i]<y.a[i]) return 1;
        else if(x.a[i]>y.a[i]) return 0;
    }
    return 1;
}
int work(T x,T y){
    if(x.id==y.id) return 0;
    int cnt=0;
    y.a[n+1]=1e9;
    for (int i=1;i<=n;i++){
        int id=lower_bound(y.a+1,y.a+n+1,x.a[i])-y.a;
        cnt+=(x.a[i]==y.a[id]&&id<=n);
    }
    return cnt;
}
int main(){

    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    cin>>n>>m;
    for (int k=1;k<=m;k++){
        for (int i=1;i<=n;i++){
            p++;
            for (int j=1;j<=n;j++){
                cin>>c[k][i][j];
                t[p].a[j]=c[k][i][j];
            }
            t[p].so();t[p].id=k;
        }
        for (int j=1;j<=n;j++){
            p++;
            for (int i=1;i<=n;i++) t[p].a[i]=c[k][i][j];
            t[p].so();t[p].id=k;
        }
        p++;
        for (int i=1;i<=n;i++) t[p].a[i]=c[k][i][i];
        t[p].so();t[p].id=k;
    }
    for (int i=1;i<=p;i++){
        for (int j=i+1;j<p;j++){
            if(t[i].id==t[j].id) continue;
            ans=max(ans,work(t[i],t[j]));
        }
    }
    cout<<n+n-ans;
    return 0;
}