#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>
#define MAXN 30001
using namespace std;
vector<int> Map[MAXN];
int Left,N,K;
int flag[MAXN];
vector<pair<int,int> > Edge;

int dfs(int k,int p)
{
	int v; int num=1;
	for(unsigned int i=0;i<Map[k].size();i++)
	{
		v=Map[k][i];
		if(flag[v]) continue;
		if(p==v) continue;
		num+=dfs(v,k);
	}
	return num;
}

void del(int k,int p)
{
	int v;
	for(unsigned int i=0;i<Map[k].size();i++)
	{
		v=Map[k][i];
		if(flag[v]) continue;
		if(p==v) continue;
		del(v,k);
	}
	flag[k]=1;
}

void solve()
{
	int num,p1,p2;  int k1,k2,kk;
	for(int i=1;i<=K-1;i++)
	{
		kk=0;
		for(unsigned int j=0;j<Edge.size();j++)
		{
			p1=Edge[j].first;
			p2=Edge[j].second;
			if(flag[p1] || flag[p2]) continue;
			num=dfs(p1,p2);
			if(num<=Left/2 && kk<num)
			{
				kk=num;
				k1=p1;  k2=p2;
			}
			num=dfs(p2,p1);
			if(num<=Left/2 && kk<num)
			{
				kk=num;
				k1=p1; k2=p2;
			}
		}
		del(k1,k2);
		Left-=kk;
		printf("%d ",kk);
	}
	printf("%d",Left);
}

void init()
{
	scanf("%d %d\n",&N,&K); int x,y;
	for(int i=1;i<=N-1;i++)
	{
		scanf("%d %d\n",&x,&y);
		Map[x].push_back(y);
		Map[y].push_back(x);
		Edge.push_back(make_pair(x,y));
	} Left=N;
}

int main()
{
	freopen("legacy.in","r",stdin);
	freopen("legacy.out","w",stdout);
	init();
	solve();
	return 0;
}