Codeforces Round #334 (Div. 2)-D Moodular Arithmetic（置换）

D. 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 p is an odd prime number.

Output

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

Examples

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

题意：给你p和k，问你满足题目等式的映射有多少种。

题解：首先考虑特殊情况。

（1）当k为0时，我们发现除了0以外，其他所有数的映射都有p种，总的就是p^(p-1)种映射。

（2）当k为1时，有f(x)=f(x)，可以发现这是个恒等式，因此方案数为p^p种。

（3）当k大于1时，我们考虑假设k^r%p=1,其中r为满足等式的最小的正整数。

呢么将k替换成k^r时可以列出等式，发现在置换r次后又回到f(x),因此可以发现这是一个环。

此时我们就能想到这置换群喽，（具体证明不是太清楚），但是这个环中只要确定一个数，

其他的数一定就都确定了，因此，我们只要找到换的个数就好了，然后方案数就是p^(环的个数)

#include<set>      
#include<map>         
#include<stack>                
#include<queue>                
#include<vector>        
#include<string>     
#include<time.h>    
#include<math.h>                
#include<stdio.h>                
#include<iostream>                
#include<string.h>                
#include<stdlib.h>        
#include<algorithm>       
#include<functional>        
using namespace std;                
#define ll long long          
#define inf 1000000000           
#define mod 1000000007                
#define maxn  205000    
#define lowbit(x) (x&-x)                
#define eps 1e-9  
int main(void)
{
	ll p,k,e,i,j;
	scanf("%lld%lld",&p,&k);
	if(k==0)
		e=p-1;
	else if(k==1)
		e=p;
	else
	{
		e=1;
		ll tmp=k;
		while(tmp!=1)
			e++,tmp=tmp*k%p;
		e=(p-1)/e;
	}
	ll ans=1;
	for(i=1;i<=e;i++)
		ans=ans*p%mod;
	printf("%lld\n",ans);
	return 0;
}