平常水题 - CodeForces - 359C（质数）

C. Prime Number

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Simon has a prime number x and an array of non-negative integers a1, a2, ..., an.

Simon loves fractions very much. Today he wrote out number  on a piece of paper. After Simon led all fractions to a common denominator and summed them up, he got a fraction: , where number t equals xa1 + a2 + ... + an. Now Simon wants to reduce the resulting fraction.

Help him, find the greatest common divisor of numbers s and t. As GCD can be rather large, print it as a remainder after dividing it by number 1000000007 (109 + 7).

Input

The first line contains two positive integers n and x (1 ≤ n ≤ 105, 2 ≤ x ≤ 109) — the size of the array and the prime number.

The second line contains n space-separated integers a1, a2, ..., an (0 ≤ a1 ≤ a2 ≤ ... ≤ an ≤ 109).

Output

Print a single number — the answer to the problem modulo 1000000007 (109 + 7).

Examples

input

2 2
2 2

output

8

input

3 3
1 2 3

output

27

input

2 2
29 29

output

73741817

input

4 5
0 0 0 0

output

1

Note

In the first sample . Thus, the answer to the problem is 8.

In the second sample, . The answer to the problem is 27, as 351 = 13·27, 729 = 27·27.

In the third sample the answer to the problem is 1073741824 mod 1000000007 = 73741817.

In the fourth sample . Thus, the answer to the problem is 1.

题意：题目要求的是分子和分母的最大公约数，但因为x是素数，所以其实就是要将分子

和分母都表示成（x^k）*m，m不能被x整除，然后取分子和分母k的最小值。（嗯...考数学）

参考思路 ： 点击打开链接

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
ll a[100000 + 5];

ll mod_pow(ll x,ll n,ll mod){
    ll res = 1;
    while(n > 0){
        if(n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}

int main(){
    ll n,x,s = 0,k,k1 = 0,k2 = 0,ans = 1,re;
    cin>>n>>x;
    for(int i = 1;i <= n;i++){
        cin>>a[i];
        k1 += a[i];
    }
    for(int i = 1;i <= n;i++){
        a[i] = k1 - a[i];
    }
    a[n+1] = -1;
    sort(a + 1, a + 1 + n);
    k2 = a[1];
    for(int i = 2;i <= n + 1;i++){
        if(a[i] != a[i - 1]){
            if(ans % x == 0){
                a[i - 1] += 1;
                ans = ans / x;
                i--;
            }
            else{
                k2 = a[i - 1];
                break;
            }
        }
        else ans++;
    }
    k = min(k1,k2);
    re = mod_pow(x,k,1000000007);
    cout<<re;
 }