Codeforces 359C Prime Number (数学+快速幂)

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).

Sample test(s)

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.

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <ctime>
using namespace std;
typedef long long LL;
int pri[100010];
LL mul(LL a,LL b,LL c){  
    LL ans = 1,temp = a%c;  
    while(b){  
    //  cout<<"ans"<<endl;  
        if(b&0x1){  
            ans = ans*a%c;
    }  
        a = a*a%c;  
            b>>=1;  
    }  
    return ans;  
}  
int main(){
	
	int n;
	LL x;
	while(scanf("%d%I64d",&n,&x)!=EOF){
		LL sum = 0,k = 0,num = 0,cnt = 0;
		for(int i = 1;i<=n;i++){
			scanf("%d",&pri[i]);
			sum += pri[i];
		}
		sum -= pri[n];
		for(k = pri[n],num = 0;k;k--){
			while(n&&pri[n] == k){
				n--,num++;
			}
			if(num%x)break;
			sum++;
			num/=x;
		}
		printf("%I64d\n",mul(x,sum,1000000007));
	}

	return 0;
	
}