#include<bits/stdc++.h>
using namespace std;
const int N=100005;
int now[N],to[N],cnt[N],tot,ans[N];
bool vis[N];
vector<int> s[N];
queue<int> q;
void dfs(int u)
{
	vis[u]=1;
	q.push(u);
	int len=s[u].size();
	for(int i=0;i<len;i++)
		if(++cnt[s[u][i]]==1)
			tot++;
	if(!vis[to[u]]) dfs(to[u]);
	return ;
}
int main()
{
	freopen("dance.in","r",stdin);
	freopen("dance.out","w",stdout);
	int n,k;
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++) now[i]=i,s[i].push_back(i);
	for(int i=1,a,b;i<=k;i++)
	{
		scanf("%d%d",&a,&b);
		s[now[a]].push_back(b);
		s[now[b]].push_back(a);
		swap(now[a],now[b]);
	}
	for(int i=1;i<=n;i++) to[now[i]]=i;
	for(int i=1;i<=n;i++)
		if(!vis[i])
		{
			dfs(i);
			int res=tot;
			while(!q.empty())
			{
				int u=q.front();
				q.pop();
				ans[u]=res;
				int len=s[u].size();
				for(int j=0;j<len;j++)
					if(--cnt[s[u][j]]==0)
						tot--;
			}
		}
	for(int i=1;i<=n;i++) printf("%d\n",ans[i]);
	return 0;
}