#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
struct qm
{
	int qz;
	int xh;
}he[1001];
bool cmp(qm a,qm b)
{
	if(a.qz>b.qz||a.qz==b.qz&&a.xh<b.xh)
		return 1;
	return 0;
}
bool cop(qm a,qm b)
{
	if(a.xh<b.xh)
		return 1;
	return 0;
}
int main()
{
	freopen("icow.in","r",stdin);
	freopen("icow.out","w",stdout);
	int n,t;
	cin>>n>>t;
	for(int i=1;i<=n;i++)
	{
		int q;
		cin>>q;
		he[i].qz=q;
		he[i].xh=i;
	}
	int kk=n-1;
	sort(he+1,he+n+1,cmp);
	for(int i=1;i<=t;i++)
	{
		//sort(he+1,he+n+1,cmp);
		//for(int tx=1;tx<=n;tx++)
		//{
		//	cout<<he[tx].qz<<' '<<he[tx].xh<<' ';
		//}
		cout<<he[1].xh;
		if(he[1].qz%kk==0)
		{
			int r=he[1].qz/kk;
			for(int wee=2;wee<=n;wee++)
			{
				he[wee].qz=he[wee].qz+r;
			}
			he[1].qz=0;
			sort(he+1,he+n+1,cmp);
		}
		else
		{
			int oo=he[1].xh;
			int r=he[1].qz%kk;
			he[1].qz=he[1].qz-r;
			int ttt=he[1].qz/kk;
			for(int wee=2;wee<=n;wee++)
			{
				he[wee].qz=he[wee].qz+ttt;
			}
			he[1].qz=0;
			sort(he+1,he+n+1,cop);
			for(int e=1;e<=n;e++)
			{
				if(e!=oo)
				{
					if(r>0)
					{
						he[e].qz++;
						r--;
					}
					else
						break;
				}
			}
			sort(he+1,he+n+1,cmp);
		}
		
	}
	return 0;
}