#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int q[1100]={0},n,t;
void into(){
	cin>>n>>t;
	for (int i=0;i<n;i++){
        cin>>q[i];
	}
}
void work(){
	int m;
	for(;t>0;){
        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;
        m=q[ji]%(n-1);
        for(int i=0;i<n;i++){
            if (i==ji){
                continue;
            }
            q[i]+=q[ji]/(n-1);
        }
        int i=0;
        for(;m>0;){
            if (i==ji){
                i++;
                continue;
            }
            q[i]++;
            i++;
            m--;
        }
        q[ji]=0;
        t--;
    }
}
int main()
{
    freopen("icow.in","r",stdin);
    freopen("icow.out","w",stdout);
	into();
	work();
    return 0;
}