#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
	freopen("icow.in","r",stdin);
	freopen("icow.out","w",stdout);
	int n,t,r[11000],max=0,ans,rr,n1;
	cin>>n>>t;
	n1=n-1;
	for(int i=1;i<=n;i++)
		cin>>r[i];
	for(int j=1;j<=t;j++)
	{
		for(int i=1;i<=n;i++)
			if(r[i]>max)
			{
				max=r[i];
				ans=i;
			}
		cout<<ans<<endl;
		rr=r[ans];r[ans]=0;
		for(int i=1;i<=n;i++)
			if(i!=ans)
				r[i]+=rr/n1;
		if((rr%n1)!=0)
			for(int i=1;i<=(rr%n1);i++)
			{
				if(i!=ans)
					r[i]+=1;
				if(i==ans)
					r[rr%n1+1]+=1;
			}
		//for(int i=1;i<=n;i++)
			//cout<<r[i]<<' '<<endl;
		max=0;
	}
	return 0;
}