#include<bits/stdc++.h>
const int maxn=1e4|1;
inline const void read(int &a)
{
	char c=getchar();int b=1;a=0;
	while(c<'0'||c>'9'){if(c=='-')b=-1;c=getchar();}
	while(c>='0'&&c<='9')
	{
		a=(a<<1)+(a<<3)+c-'0';
		c=getchar();
	}
	a*=b;
}
inline const void write(int a)
{
	if(a>9)write(a/10);
	putchar(a%10+'0');
}
inline const int lowbit(int a)
{
	return a&(-a);
}
int sum[maxn],n,m,t;
inline const void add(int a)
{
	while(a<=n)
	{
		sum[a]++;
		a+=lowbit(a);
	}
}
inline const int query(int a)
{
	int ans=0;
	while(a)
	{
		ans+=sum[a];
		a-=lowbit(a);
	}
	return ans;
}
struct monotonous_queue
{
	int que[maxn],end;
	inline const void init(){end=0;}
	inline const void add(int a)
	{
		if(empty()||a<que[end]){que[++end]=a;return ;}
		while(a>que[end]){que[end]=a;end--;}
	}
	inline const bool empty()
	{
		if(end)return false;
		return true;
	}
}s;
int main()
{
	read(n);read(m);read(t);
	memset(sum,0,sizeof(sum));
	while(m)
	{
		s.init();
		for(int i=1;i<=n;i++)
		{
			
		}
		m--;
	}
	for(int i=1;i<=n;i++){write(query(i));putchar(' ');}
	return 0;
}