#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(ll i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 510000;
ll dy[8] = {1,-1,0,0,1,-1,1,-1};
ll dx[8] = {0,0,1,-1,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
const int mod = 1e9 + 7;
//const int mod = 998244353;

vvl matmul(vvl &a, vvl &b){
    vvl c(a.size(), vl(b[0].size()));
    for(int i=0; i<a.size(); i++){
        for(int k=0; k<b.size(); k++){
            for(int j=0; j<b[0].size(); j++){
                c[i][j] += a[i][k] * b[k][j] % mod;
                c[i][j] %= mod;
            }
        }
    }
    return c;
}

vvl matpow(vvl a, ll n){
    vvl b(a.size(), vl(a.size()));
    for(int i=0; i<a.size(); i++) b[i][i] = 1;
    while(n > 0){
        if(n & 1) b = matmul(b,a);
        a = matmul(a,a);
        n >>= 1;
    }
    return b;
}

int main(){
    ll p,k; cin >> p >> k;
    vvl b(p,vl(p,1));
    rep(i,p){
        rep(j,p){
            b[i][i*j%p]++;
        }
    }
    b = matpow(b,k);
    cout << b[0][0] << endl;
}