#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define int long long
#define double long double
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define S second
#define F first
#define fall(i,a,n) for(int i=a;i<=n;i++)
#define rfall(i,a,n) for(int i=a;i>=n;i--)
#define pb push_back
#define all(x) x.begin(),x.end()
#define lsb(x) (x & -x)
#define sz(x) (int)x.size()
const int MAXN=2e5+10;
const int MAXL=33;
const int inf=1e17;
const int MOD=998244353;
const int HASHBASE=146527;
const int HASHMOD=1e9+7;
typedef pair<int,int> pii;
typedef tuple<int,int,int> trio;
typedef tuple<int,int,int,int> squad;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n,m,dist[MAXN],dp[MAXN];
vector<int> g[MAXN],rev[MAXN];
bool vis[MAXN],mark[MAXN];
int32_t main(){
std::ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>m;
fall(i,1,m){
int a,b; cin>>a>>b;
g[a].pb(b); rev[b].pb(a);
}
fall(i,1,n-1)dist[i]=inf;
queue<int> fila; fila.push(0);
while(!fila.empty()){
auto x=fila.front(); fila.pop();
for(auto u:g[x]){
if(dist[u]==inf){
dist[u]=dist[x]+1;
fila.push(u);
}
}
}
fall(i,0,n-1)dp[i]=inf;
dp[n-1]=0;
priority_queue<pii,vector<pii>,greater<pii>> pq; pq.push({0,n-1});
while(!pq.empty()){
auto [lz,x]=pq.top(); pq.pop();
if(mark[x]) continue;
mark[x]=1;
if(x!=n-1) dp[x]=max(dp[x],dist[x]);
for(auto u:rev[x]){
if(!mark[u] && dp[u]>dp[x]+1){
dp[u]=dp[x]+1;
pq.push({dp[u],u});
}
}
}
fall(i,0,n-2) cout<<dp[i]<<" ";
cout<<"\n";
}
