#include <bits/stdc++.h>
using namespace std;

#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);i++)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);i--)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(hoge) (hoge).begin(),(hoge).end()
#define en '\n'
using ll = long long;
using ull = unsigned long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
typedef pair<ll, ll> P;
constexpr long long INF = 1LL << 60;
constexpr int INF_INT = 1 << 25;
constexpr long long MOD = (ll) 1e9 + 7;
//constexpr long long MOD = 998244353LL;
typedef vector<ll> Array;
typedef vector<Array> Matrix;


template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

struct Edge {
	ll to, cap, rev;
	Edge(ll _to, ll _cap, ll _rev) {
	to = _to; cap = _cap; rev = _rev;
	}
};
using Edges = vector<Edge>;
using Graph = vector<Edges>;

void add_edge(Graph& G, ll from, ll to, ll cap, bool revFlag, ll revCap) {
	G[from].push_back(Edge(to, cap, (ll)G[to].size()));
	if (revFlag)G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));
}

Matrix mIdentity(ll n) {
 Matrix A(n, Array(n));
 for (int i = 0; i < n; ++i) A[i][i] = 1;
 return A;
}

Matrix mMul(const Matrix& A, const Matrix& B) {
 Matrix C(A.size(), Array(B[0].size()));
 for (int i = 0; i < C.size(); ++i)
  for (int j = 0; j < C[i].size(); ++j)
   for (int k = 0; k < A[i].size(); ++k)
    (C[i][j] += (A[i][k] % MOD) * (B[k][j] % MOD)) %= MOD;
 return C;
}
// O( n^3 log e )
Matrix mPow(const Matrix& A, ll e) {
 return e == 0 ? mIdentity(A.size()) :
  e % 2 == 0 ? mPow(mMul(A, A), e / 2) : mMul(A, mPow(A, e - 1));
}

void solve(){
    ll m,k;
    cin>>m>>k;
    Matrix a(m,Array(m,0));
    REP(i,m){
        REP(j,m){
            ll y=(i+j)%m;
            a[y][i]++;
            y=(i*j)%m;
            a[y][i]++;
        }
    }

    Matrix f = mPow(a,k);
    Matrix dp(m,Array(1,0));
    dp[0][0]=1;

    Matrix ans=mMul(f,dp);
    cout<<ans[0][0]<<en;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    solve();
    //ll t;cin>>t;REP(i,t) solve();

    return 0;
}