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

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e6;

int N, M;
pii A[MAXN+10];
int B[MAXN+10], chk[MAXN+10];
int dp[MAXN+10], ans[MAXN+10];

int main()
{
	scanf("%d%d", &N, &M);
	for(int i=1; i<=N; i++) scanf("%d%d", &A[i].first, &A[i].second);

	for(int i=1; i<=N; i++) A[N+i]=A[i];
	A[N+N+1]=A[1];
	
	int pos;
	for(int i=1; i<=N+N+1; i++)
	{
		if(!chk[A[i].first]) B[i]=A[i].first;
		else if(!chk[A[i].second]) B[i]=A[i].second;
		else { pos=i; break; }
		chk[B[i]]=i;
	}
	for(int i=pos-1; i>=1; i--)
	{
		if(B[i]==A[i].second) dp[i]=i;
		else
		{
			if(chk[A[i].second]==0) dp[i]=pos;
			else dp[i]=dp[chk[A[i].second]];
		}
		ans[dp[i]%N]++; M--;
	}
	ans[pos%N]+=M;
	for(int i=1; i<=N; i++) printf("%d\n", ans[i%N]);
}