#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int mod2 = 998244353;
void fact_init(int n);
long long exp(long long taban, long long us, long long md);
long long ebob(long long a, long long b);
long long ekok(long long a, long long b);
long long komb(long long a, long long b);
vector<long long> fact;
vector<long long> inv_fact;
void fact_init(int n) {
  fact.resize(n + 5);
  inv_fact.resize(n + 5);
  fact[0] = inv_fact[0] = 1;
  for (int i = 1; i <= n; i++) {
    fact[i] = (fact[i - 1] * i) % mod;
    inv_fact[i] = exp(fact[i], mod - 2, mod);
  }
}
long long exp(long long taban, long long us, long long md) {
  long long carpan = taban % md;
  if (carpan == 0) return 0;
  long long temp = us;
  long long res = 1;
  while (temp) {
    if (temp % 2) res = (res * carpan) % md;
    temp /= 2;
    carpan = (carpan * carpan) % md;
  }
  return res;
}
long long ebob(long long a, long long b) {
  if (!a) return b;
  return ebob(b % a, a);
}
long long ekok(long long a, long long b) { return (a * b) / ebob(a, b); }
long long komb(long long a, long long b) {
  if (a < b) return 0;
  return fact[a] * (inv_fact[a - b] * inv_fact[b] % mod) % mod;
}
const int N = 1e6 + 5;
const int logN = log2(N);
vector<vector<int>> vec(N);
bool vis[N];
bool vis_dfs[N];
bool dfs(int cur, int& cnt) {
  bool dongu = false;
  vis[cur] = true;
  for (auto x : vec[cur]) {
    if (x == cur) continue;
    dongu |= vis_dfs[x];
    if (!vis_dfs[x]) {
      vis_dfs[x] = true;
      dongu |= dfs(x, ++cnt);
      vis_dfs[x] = false;
    }
  }
  return dongu;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int p, k;
  cin >> p >> k;
  for (int i = 0; i < p; i++) {
    vec[i].push_back((long long)i * k % p);
  }
  long long ans = 1;
  for (int i = 0; i < p; i++) {
    if (i == vec[i][0]) {
      if (k - 1 == 0) ans = ans * p % mod;
      continue;
    }
    if (vis[i]) continue;
    int node_cnt = 1;
    vis_dfs[i] = true;
    bool dongu_var_mi = dfs(i, node_cnt);
    vis_dfs[i] = false;
    if (!dongu_var_mi || exp(k, node_cnt, p) - 1 == 0) ans = ans * p % mod;
  }
  cout << ans << "\n";
}
