#include<bits/stdc++.h>
using namespace std;
int c,t,n,k,x,y,key[100010],cnt;
int read()
{
	int r=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9') w=ch=='-'?-1:w,ch=getchar();
	while(ch>='0'&&ch<='9') r=r*10+ch-'0',ch=getchar();
	return r*w;
}
struct edge
{
	int scd,nxt;
}a[200010];
void add(int x,int y)
{
	a[++cnt]={y,key[x]};
	key[x]=cnt;
	a[++cnt]={x,key[y]};
	key[y]=cnt;
}
void dfs(int x,int f)
{
	for(int i=key[x];i;i=a[i].nxt)
	if(a[i].scd!=f)
	dfs(a[i].scd,x);
}
int main()
{
	freopen("traverse.in","r",stdin);
	freopen("traverse.out","w",stdout);
	c=read(),t=read();
	n=read(),k=read();
	while(t--)
	cout<<1<<endl;
} 
