#include<iostream>
#include<cstdio>
#include<stdio.h>
using namespace std;
int cmp(int x,int y){
	return x>y;
}
int main(){
	int n,t;
	int z;
	cin>>n>>t;
	int b[1005]={0};
	int a[1005];
	for(int i=1;i<=n;i++){
		cin>>a[i];
		b[i]=a[i];
	}
	sort(b+1,b+1+n,cmp);
	//for(int i=1;i<=n;i++){
	//	cout<<b[i]<<endl;
	//}
	for(int i=1;i<=t;i++){
		for(int l=1;l<=n;l++){
			if(b[1]==a[l]){
				cout<<l<<endl;
				a[l]=0;
			}
			
			//sort(b+1,b+1+n,cmp);
			
			//sort(b+1,b+1+n,cmp);
		}
		int y;
		y=b[1]%(n-1);
		//cout<<y<<endl;
		//int x;
		//x=b[i]/(n-1)
		int o=b[1];
			//cout<<o<<endl;
		if(y==0){
			for(int u=1;u<=n;u++){
				if(a[u]!=0){
					a[u]=a[u]+y;
					b[u]=a[u];
					//cout<<a[u]<<endl;
					}
				}
			}
		if(y==1){
			for(int p=1,z=1;p<=o;p++,z++){
				if(a[z]!=0){
					a[z]=a[z]+1;
					//cout<<a[z];
					b[z]=a[z];
					//cout<<a[z];
					//z=z+1;
					cout<<a[z]<<z<<endl;
				}
				//cout<<endl;
				if(z==n){
					z=1;
				}
			}
		}
		sort(b+1,b+1+n,cmp);
		//for(int m=1;m<=n;m++){
		//	cout<<b[i]<<endl;
		//}
	}

	return 0;
}