7.19CF div2 A

http://codeforces.com/contest/450/problem/A   

#include<iostream>
#include<cstdlib>
#include<cstring>
using namespace std;
int main(){
    int n,m,x,k;
    while(cin>>n>>m){
        int max=-1;
        for(int i=1;i<=n;i++){
            cin>>x;
            if((x-1)/m>=max){
                k=i;    
                max=(x-1)/m;
            }
            //cout<<k<<" "<<endl;
        }
        cout<<k<<endl;
    }
    return 0;
}