#include <cstdio> 
#include <algorithm>
#include <iostream> 
#define SM 402600
#define INF 999999999

int n , t  ;

struct music {
    int number , wt ;
} a[SM] ;

inline int cmp ( music x , music y ) {
    return x . wt > y . wt ;
}

inline int comp ( int l , int r ) {
    int max = a[l].wt ; 
    int num = l ;
    for ( int i = l ; i <= r ; i ++ ) 
        if ( max < a[i].wt ) {
            max = a[i].wt ; 
            num = a[i].number ;
        }
    return num ;
}
// comp 表示从 x -> y ,最大权重的下标 
inline int Solvej ( ) {
    std :: sort ( a + 1 , a + n + 1 , cmp ) ;
/*	for ( int i = 1 ; i <= n ; i ++ ) {
        std :: cout << a[i].wt << "   " << a[i].number << '\n';
    }
    std :: cout << '\n' ; */
    int ans = a[1].wt;
    //std :: cout << "此时最大的权重" << ans << '\n' ; 
    if ( ans % ( n - 1 ) == 0 ) {
        int sum = ans / ( n - 1 ) ;
        for ( int i = 2 ; i <= n ; i ++ ) 
            a[i].wt += sum ;
        a[1].wt = 0 ;
        /*for ( int i = 1 ; i <= n ; i ++ ) {
            std :: cout << "1此时的作标:" << i << '\n'; 
            std :: cout << "1此时的权重:" << a[i].wt <<" " ;
            std :: cout << "1此时的数下标:" << a[i].number << '\n' ; 
        }*/
    } 
    else {
        int sumT = ans / ( n - 1 ) ;
        int kasT = ans - sumT * ( n - 1 ) ;
    //	std :: cout << "kasT：" << kasT <<'\n' ;
        for ( int i = 2 ; i <= n ; i ++ )
            a[i].wt += sumT ;
        int i = 2 ;
        while ( kasT >= 1 ) {
            a[i].wt += 1 ;
            i ++ ;
            kasT -- ;
        }
        a[1].wt = 0 ;

        /*for ( int i = 1 ; i <= n ; i ++ ) {
            std :: cout << "2此时的作标:" << i << '\n'; 
            std :: cout << "2此时的权重" << a[i].wt <<" " ;
            std :: cout << "2此时的数下标" << a[i].number << '\n' ; 
        }*/
    }
}


int main () {
    scanf ( "%d%d" , &n , &t ) ;
    for ( int i = 1 ; i <= n ; i ++ ) {
        scanf ( "%d" , &a[i].wt ) ;
        a[i].number = i ;
    }

    std :: printf ( "%d\n" , comp ( 1 , n ) ) ;
    //std :: cout << '\n' ;

    for ( int i = 1 ; i <= t ; i ++ ) {
        Solvej ( ) ;
        //std :: cout << '\n' ;std :: cout << '\n' ;std :: cout << '\n' ;std :: cout << '\n' ;
        std :: printf ( "%d\n" , comp ( 2 , n ) ) ;
    }
    return 0 ;
}