#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
typedef long long ll;
using namespace std;
constexpr int N=5e5+5,mod=998244353;
int n,m,scc,tim,top,dfn[N],low[N],bel[N],stk[N],deg[N],dp[N],ans[N];
bool ins[N];
vector<int>G[N],ele[N],E[N];
inline void tarjan(int x){
    dfn[x]=low[x]=++tim;
    stk[++top]=x,ins[x]=true;
    for(auto y:G[x]){
        if(!dfn[y]){
            tarjan(y);
            low[x]=min(low[x],low[y]);
        }
        else if(ins[y])low[x]=min(low[x],dfn[y]);
    }
    if(dfn[x]==low[x]){
        ++scc;
        int w;
        do{
            w=stk[top],--top;
            ins[w]=false;
            ele[scc].emplace_back(w);
            bel[w]=scc;
        }while(w!=x);
    }
}
queue<int>q;
inline void topsort(){
    rep(i,1,scc)dp[i]=ele[i].size();
    rep(i,1,scc)if(!deg[i])q.push(i);
    while(!q.empty()){
        int u=q.front();q.pop();
        for(auto v:E[u]){
            dp[v]+=dp[u];
            if(!--deg[v])q.push(v);
        }
    }
    rep(i,1,scc){
        for(auto x:ele[i])ans[x]=dp[i];
    }
}
int main(){
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    cin>>n>>m;
    rep(i,1,m){
        int x,lst=0;
        rep(j,1,n){
            cin>>x;
            if(lst)G[x].emplace_back(lst);
            lst=x;
        }
    }
    rep(i,1,n)if(!dfn[i])tarjan(i);
    rep(i,1,n)
        for(auto x:G[i])if(bel[i]^bel[x])
            E[bel[i]].emplace_back(bel[x]);
    rep(i,1,scc){
        sort(E[i].begin(),E[i].end());
        E[i].resize(unique(E[i].begin(),E[i].end())-E[i].begin());
        for(auto x:E[i])++deg[x];
    }
    topsort();
    rep(i,1,n)cout<<ans[i]-1<<' ';cout<<'\n';
    return 0;
}