#include <bits/stdc++.h>
#pragma GCC optimize("O3", "Ofast")
#define int long long
#define ll long long
#define se second
#define fi first
#define pb push_back
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii,pii> ipii;
const int MAXN = 5e5+10;
const int MAXA = 5e4+10;
const int SQRT = 300;
const ll INF = 2e18;
const int MOD = 1e9+7;
const int LOG = 32;
ll sum(auto a, auto b){
ll te = a+MOD+b;
for(; te >= MOD; ) te -= MOD;
return te;
}
void chsum(auto &a, auto b){ a = sum(a,b); }
ll mul(auto a, auto b){ return 1ll*a*b%MOD; }
void chmul(auto &a, auto b){ a = mul(a,b); }
void chmn(auto &a, auto b){ a = min(a, b); }
void chmx(auto &a, auto b){ a = max(a, b); }
ll expo(int a, int b){
if(b==0) return 1;
ll te = expo(a, b/2); te = mul(te,te); // temporary -> te
return (b%2 ? mul(te, a) : te);
}
vector <int> dx = {0, 0, -1, 1};
vector<int> dy = {-1, 1, 0, 0};
int n, m;
vector<int> adj[MAXN], tree[MAXN];
bool done[MAXN];
int dis[MAXN], dp[MAXN], ans[MAXN];
void bfs(int sta){
for(int i=1; i<=n; i++) dis[i] = INF;
queue <pii> q;
dis[1] = 0; q.push({0, 1});
while(!q.empty()){
auto [d, nw] = q.front(); q.pop();
for(auto nx : tree[nw]){
if(dis[nx] > d+1){
dis[nx] = d+1;
q.push({dis[nx], nx});
}
}
}
}
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n>>m;
for(int i=1; i<=m; i++){
int x, y; cin>>x>>y;
x++; y++;
adj[y].pb(x); tree[x].pb(y);
}
bfs(1);
set<pii> s;
for(int i=1; i<=n; i++){
if(i<=n-1) dp[i] = INF, ans[i] = INF;
s.insert({ans[i], i});
// cout << i << ' '<< dis[i] << " dis\n";
}
while(!s.empty()){
auto [d, nw] = *s.begin(); s.erase(s.begin());
done[nw] = 1;
// max(dis[i], {dp[nx]}+1)
for(auto nx : adj[nw]){
if(!done[nx] && dp[nx] > d+1){
s.erase(pii(ans[nx], nx));
dp[nx] = d+1;
ans[nx] = max(dis[nx], dp[nx]);
s.insert(pii(ans[nx], nx));
}
}
}
for(int i=1; i<=n-1; i++) cout << ans[i] << ' ';
cout << '\n';
}
