603B - Moodular Arithmetic

B. Moodular Arithmetic

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

As behooves any intelligent schoolboy, Kevin Sun is studying psycowlogy, cowculus, and cryptcowgraphy at the Bovinia State University (BGU) under Farmer Ivan. During his Mathematics of Olympiads (MoO) class, Kevin was confronted with a weird functional equation and needs your help. For two fixed integers k and p, where p is an odd prime number, the functional equation states that

for some function . (This equation should hold for any integer x in the range 0 top - 1, inclusive.)

It turns out that f can actually be many different functions. Instead of finding a solution, Kevin wants you to count the number of distinct functions f that satisfy this equation. Since the answer may be very large, you should print your result modulo 109 + 7.

Input

The input consists of two space-separated integers p and k (3 ≤ p ≤ 1 000 000, 0 ≤ k ≤ p - 1) on a single line. It is guaranteed that pis an odd prime number.

Output

Print a single integer, the number of distinct functions f modulo 109 + 7.

Sample test(s)

input

3 2

output

3

input

5 4

output

25

Note

In the first sample, p = 3 and k = 2. The following functions work:

1. f(0) = 0, f(1) = 1, f(2) = 2.
2. f(0) = 0, f(1) = 2, f(2) = 1.
3. f(0) = f(1) = f(2) = 0.

当k=0时，可以推出f(0)=0 答案为pp - 1

当k=1时，可以推出f(x)=f(x) 所以可以为任何值，答案为 pp

当k>1时，把x=0代入原式可以得出f(0)=0  m为循环节。。所以答案为 

#include <bits/stdc++.h>
using namespace std;
const int MOD=1e9+7;
int cal(int p,int cnt){
    if(cnt==0) return 1;
    return (long long)p*cal(p,cnt-1)%MOD;
}

int main(){
    int p,k;
    cin>>p>>k;
    if(k==0){
        cout<<cal(p,p-1);
    }
    else if(k==1){
        cout<<cal(p,p);
    }
    else {
        int m=1;
        int w=k;
        for(;w!=1;m++){
            w=(long long)w*k%p;
        }
        cout<<cal(p,(p-1)/m);
    }
    return 0;
}