#257 A.B

A. Jzzhu and Children

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 test(s)

Input

5 2
1 3 1 4 2

Output

4

Input

6 4
1 1 2 2 3 3

Output

6

Note

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.

这个题想到的就是用队列来模拟小孩的队伍顺序

#include <cstdio>
#include <algorithm>
#include <queue>

using namespace std;
#define MAX_N 200
typedef pair <int , int > p;
p a[MAX_N];

int main(){
        queue <p> que;
        int n,m;
        scanf("%d%d", &n, &m);
        for(int i = 0;i < n; i++){
                scanf("%d", &a[i].first);
                
                a[i].second = i+1;
                que.push(a[i]);
        }

        p Q;
        while(!que.empty()){
                 Q = que.front();que.pop();
                 
                if(Q.first > m){
                                
                        que.push(p(Q.first - m,Q.second));
                
                }

        }
        printf("%d\n", Q.second);



        return 0;
}

B. Jzzhu and Sequences

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Jzzhu has invented a kind of sequences, they meet the following property:

You are given x and y, please calculate f_n modulo 1000000007 (10⁹ + 7).

Input

The first line contains two integers x and y (|x|, |y| ≤ 10⁹). The second line contains a single integer n (1 ≤ n ≤ 2·10⁹).

Output

Output a single integer representing f_n modulo 1000000007 (10⁹ + 7).

Sample test(s)

Input

2 3
3

Output

1

Input

0 -1
2

Output

1000000006

Note

In the first sample, f₂ = f₁ + f₃, 3 = 2 + f₃, f₃ = 1.

In the second sample, f₂ =  - 1;  - 1 modulo (10⁹ + 7) equals (10⁹ + 6).

当时推导出了几个式子  发现是个循环

f[3] = f[2] - f[1];

        f[4] = -f[1];
        f[5] = -f[2];
        f[6] = f[1] - f[2];

#include <cstdio>
#include <cstring>

using namespace std;

#define MAX_N 1000000007
#define MOD 1000000007

int main(){
        long long n;
        long long f[10];
        
        scanf("%lld%lld", &f[1], &f[2]);
        scanf("%lld", &n);
        f[3] = f[2] - f[1];
        f[4] = -f[1];
        f[5] = -f[2];
        f[6] = f[1] - f[2];
        int m = n % 6;
        if(f[m] < 0) printf("%lld\n", f[m] + MOD);
        else printf("%lld\n", f[m]);

        return 0;
}