#include<bits/stdc++.h>
using namespace std;
#define maxN 100005

int n,m,u,v,dp[maxN];
vector<int> G[maxN],a;
bool vis[maxN];
int dfs(int p)
{
	//cout << p << endl;
	if(vis[p])
		return 0;
	int ans = 1;
	vis[p] = 1;
	if(!G[p].empty())
		for(int i = 0; i < G[p].size(); i++)
			ans += dfs(G[p][i]);
	return ans;
}
int main()
{
   cin >> n >> m;
   for(int i = 1; i <= m; i++)
   {
    	cin >> u >> v;
    	G[u].push_back(v);
    	G[v].push_back(u);
   }
    memset(vis,0,sizeof(vis));
    for(int i = 1; i <= n; i++)
    {
    	int x = dfs(i);
    	if(x != 0)
    		a.push_back(x);
   	}
    /*for(int i = 0; i < a.size(); i++)
    	cout << a[i] << ' ';
    cout << endl;*/
    for(int i = 1; i <= n; i++)
    	dp[i] = maxN*maxN;
    dp[0] = 0;
    for(int i = 0; i < a.size(); i++)
    {
    	for(int j = n; j > a[i]; j--)
    	{
    		
    		//if(dp[j] > dp[j-a[i]]+1)
    		//cout << "dp[" << i << "][" << j << "]=" << "dp[" << i - 1 << "][" << j - a[i] << "]+1=" <<dp[j-a[i]]<<endl;
    		dp[j] = min(dp[j],dp[j-a[i]]+1);
		}
    	dp[a[i]] = 0;
		
	}
	for(int i = 1; i <= n; i++)
		cout << dp[i] << endl;
    return 0;
}