Jzzhu and Children

Description

There are n children in Jzzhu's school. Jzzhu is going to give some candies to them. Let's number all the children from 1 to n. The i-th child wants to get at least a_i candies.

Jzzhu asks children to line up. Initially, the i-th child stands at the i-th place of the line. Then Jzzhu start distribution of the candies. He follows the algorithm:

1. Give m candies to the first child of the line.
2. If this child still haven't got enough candies, then the child goes to the end of the line, else the child go home.
3. Repeat the first two steps while the line is not empty.

Consider all the children in the order they go home. Jzzhu wants to know, which child will be the last in this order?

Input

The first line contains two integers n, m(1 ≤ n ≤ 100; 1 ≤ m ≤ 100). The second line contains n integers a₁, a₂, ..., a_n(1 ≤ a_i ≤ 100).

Output

Output a single integer, representing the number of the last child.

Sample Input

Input

5 2
1 3 1 4 2

Output

4

Input

6 4
1 1 2 2 3 3

Output

6

Hint

Let's consider the first sample.

Firstly child 1 gets 2 candies and go home. Then child 2 gets 2 candies and go to the end of the line. Currently the line looks like [3, 4, 5, 2] (indices of the children in order of the line). Then child 3 gets 2 candies and go home, and then child 4 gets 2 candies and goes to the end of the line. Currently the line looks like [5, 2, 4]. Then child 5 gets 2 candies and goes home. Then child 2 gets two candies and goes home, and finally child 4 gets 2 candies and goes home.

Child 4 is the last one who goes home.

题意简介：要给n个人发糖果，每人发m颗；糖果有无限颗，但是每个人需要的糖果数不同，所以要求这n个人自觉排队，自热是从1到n的顺序；如果第i个人拿到的糖果数目大于m则回家，否则继续排队直到拿满。问最后一个走的人是谁？

错了好几遍，肯定是做麻烦了，虽然最后A了。

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>

using namespace std;

int main()
{
    int n,m,max=0;
    int a[1000],b[1000];
    int c[10010];
    scanf("%d%d",&n,&m);
    for(int i=1; i<=n; i++)
    {
        cin>>b[i];
    }
    for(int i=1; i<=n; i++)
    {
        a[i]=i;
    }
    for(int i=1; i<=n; i++)
    {
        if(b[i]>max)max=b[i];//找到最大的值
    }
    int k=1;
    if(max%m==0)//如果为0,那么只有max-m+1——>max范围内的数才对结果有影响，所以全部找到，存进c[]中。
    for(int i=1; i<=n; i++)
    {
        if(b[i]>=max-m+1)
        {
            c[k++]=b[i];
        }
    }
    else//不为0，那么只有(((max/m)*m)+1)——>max范围内有影响，全部找到，存进c[]中。
    {
        for(int i=1; i<=n; i++)
    {
        if(b[i]>=(((max/m)*m)+1))
        {
            c[k++]=b[i];
        }
    }
    }

    for(int i=n; i>=1; i--)
    {
        if(c[k-1]==b[i])//找到最后面那个输出就可以了。
        {
            printf("%d\n",a[i]);
            break;
        }
    }
    return 0;
}