#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int q[1100]={0};
int main()
{
	int n=0,t=0;
	freopen("icow.in","r",stdin);
	freopen("icow.out","w",stdout);
	cin>>n>>t;
	for (int i=0;i<n;i++)
		cin>>q[i];
	while (t)
	{
		int min=0,ji=0;
		for (int i=0;i<n;i++)
		{
			if (q[i]>min)
			{
				min=q[i];
				ji=i;
			}
		}
		cout<<ji+1<<endl;
		int yu;
		yu=q[ji]%(n-1);
		for (int i=0;i<n;i++)
		{
			if (i==ji)
			{
				continue;
			}
			q[i]+=q[ji]/(n-1);
		}
		int i=0;
		while (yu>0)
		{
			if (i==ji)
			{
				i++;
				continue;
			}
			q[i]++;
			i++;
			yu--;
		}
		q[ji]=0;
		t--;
	}
	return 0;
}