hdu 3887

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <list>
#include <queue>
#include <stack>
#include <cmath>

using namespace std;

#define PF(x) (scanf("%d",&x))
#define PT(x,y) (scanf("%d%d",&x,&y))
#define PR(x) (printf("%d\n",x))
#define PRT(x,y)(printf("%d %d\n",x,y))
#define PB(x)(scanf("%I64d",&x))
#define PRB(x)(printf("%I64d\n",(x)))
#define For(i,n) for(int i=0;i<(n);i++)
#define CLR(ar) (memset(ar,0,sizeof(ar)))
#define CLR1(ar) (memset(ar,-1,sizeof(ar)))
#define PBE(x) (scanf("%I64d",&x)!=EOF)
#define Max(x,y) (x)>(y)?(x):(y)
#define Min(x,y) (x)>(y)?(y):(x)
#define L(x) (x<<1)
#define R(x) ((x<<1)|1)
#define Mid(x,y) ((x+y)>>1)

typedef __int64 LL;
#define N 100005
#define M 105
#define Mod 1000
#define Inf 0x7fffffff

vector<int> G[N];
int n,m;
int finish[N];
int start[N];
int ar[N];
int time = 1;
int ans[N];
int out[N];
int in[N];
stack<int> GG;

int lowbit(int x)
{
	return x&(-x);
}
void add(int x,int var)
{
	for(;x<=n;x+=lowbit(x))
		ar[x]+=var;


}

int sums(int x)
{
	int s= 0;
	for(;x;x-=lowbit(x))
	{
		s += ar[x];
	}
	return s;
}
void dfs(int v)
{
	CLR(in);
	add(v,1);
	while(!GG.empty())
	{
		int t = GG.top();

		
		if(!in[t])
		{
			ans[t] = sums(t);
			in[t] = 1;
		}
		else if(G[t].size()!=0)
		{
			if(!in[G[t].back()])
			GG.push(G[t].back());
			G[t].pop_back();
		}
		else
		{
			ans[t] = sums(t) - ans[t];
			GG.pop();
			add(t,1);
		}
	}
}
bool readata()
{
	PT(n,m);
	if(n==0 && m==0) return false;

	CLR(out);
	For(i,n-1)
	{
		int x,y;
		PT(x,y);
		G[x].push_back(y);
		G[y].push_back(x);
	}
	time = 0;
	while(!GG.empty()) GG.pop();
	GG.push(m);
	CLR(ar);

	dfs(m);
	return true;
}
void cal()
{
	
    For(i,n)
	{
	   if(i==0) {printf("%d",ans[i+1]);}
	   else printf(" %d",ans[i+1]);
	}
	puts("");
	
}
void init()
{
	while(readata())
	{
		cal();
	}
	return ;
}

int main()
{
	init();
	return 0;
}