Codeforces Jzzhu and Children

#include<bits/stdc++.h>

using namespace std;

#define fast ios_base::sync_with_stdio(0)
#define bfast cin.tie(0)
#define outs(x) cout << x << " "
#define outn(x) cout << x << "\n"
#define sf scanf
#define pf printf
#define nl puts("")
#define psb push_back
#define mset(c,v) memset(c , v , sizeof c)
#define loop0(n) for(int i=0; i<n; i++)
#define loop1(n) for(int i=1; i<=n; i++)
#define mpair(x , y) make_pair(x , y)
#define all(x) x.begin(), x.end()
#define pi acos(-1.0)
#define psb push_back

typedef unsigned long long ull;
typedef long long LL;
typedef vector<int>vii;
typedef vector<LL>vll;
typedef vector<string>vs;
typedef map<int, int>mpii;
typedef map<string, int>mpsi;
typedef map<char, int>mpci;
typedef map<LL, LL>mpll;

const int mod = 1000007;
const int high = 102;

queue<int>Q;

void check()
{
    while(!Q.empty())
    {
        cout << Q.front() << "; ";
        Q.pop();
    }
}

int main()
{
    fast;
    int n, m;
    int ar[high];
    while(cin >> n >> m)
    {
        for(int i=1; i<=n; i++)
        {
            int x;
            cin >> x;
            Q.push(x);
            ar[x] = i;
        }

        //check();
        while(Q.size() > 1)
        {
            int u = Q.front();

            if(u > m)
            {
                Q.push(u - m);
                int tmp = ar[u];
                ar[u-m] = tmp;
                //cout << u << "; ";
            }

            Q.pop();
        }

        //cout << Q.front() << "-" << ar[Q.front()] << "\n";
        cout << ar[Q.front()] << "\n";

        Q.pop();
    }

    return 0;
}