#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define endl '\n'
const int inf = 1000000007;
const ll INF = 1e18;
// int mod = 998244353;
int mod = 1000000007;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return 1; } return 0; }
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template<typename T, typename U> T pow_(T a, U b) { return b ? pow_(a * a, b / 2) * (b % 2 ? a : 1) : 1; }
ll modpow(ll a, ll b, ll _mod) { return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1; }
template<class T, class U> ostream& operator << (ostream& os, const pair<T, U>& p) { os << p.F << " " << p.S; return os; }
template<class T> ostream& operator << (ostream& os, const vector<T>& vec) { rep(i, sz(vec)) { if (i) os << " "; os << vec[i]; } return os; }
template<typename T> inline istream& operator >> (istream& is, vector<T>& v) { rep(j, sz(v)) is >> v[j]; return is; }
template<class T, class T2> inline void add(T &a, T2 b) { a += b; if (a >= mod) a -= mod; }


void solve();

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(10);
  int T;
  T = 1;
  while (T--) solve();
}

// https://yukicoder.me/problems/no/1050/editorial
// 操作回数が多い, 累乗する

typedef vector<ll> vec; // エラー起きないよう使って
typedef vector<vector<ll> > mat;
struct Matpow {
  int m; // matpow で代入される
  vec matmul(vec &dp, mat &mt) {
    vec ret(m, 0);
    for (int i = 0; i < m; ++i) for (int j = 0; j < m; ++j) {
      (ret[i] += mt[i][j] * dp[j]) %= mod;
    }
    return ret;
  }
  mat update(mat &mt) {
    mat ret(m, vec(m, 0));
    for (int i = 0; i < m; ++i) for (int j = 0; j < m; ++j)
      for (int k = 0; k < m; ++k) {
      (ret[i][j] += mt[i][k] * mt[k][j]) %= mod;
    }
    return ret;
  }
public:
  void matpow(vec &dp, mat &mt, ll k) { // dp * mt^k
    m = (int)dp.size();
    while (k) { // logK
      if (k & 1) dp = matmul(dp, mt);
      mt = update(mt); // N^3
      k >>= 1;
    }
  }
};

void solve() {
  int m, k;
  cin >> m >> k;
  vector<vector<ll> > c(m, vector<ll>(m));
  rep(i, m) rep(k, m) {
    int j = (i + k) % m;
    c[i][j]++;
    j = i * k % m;
    c[i][j]++;
  }
  // rep(i, m) cout << c[i] << endl;

  vector<ll> a(m);
  a[0] = 1;

  Matpow _mat;
  _mat.matpow(a, c, 1LL * k);
  cout << a[0] << endl;
}