#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 50
#else
#define SIZE 50
#endif

int MOD=1e9+7;
void matmul(int a[SIZE][SIZE], int b[SIZE][SIZE]) {
    int tmp[SIZE][SIZE];
    REP(x,SIZE)REP(y,SIZE) tmp[x][y] = 0;
    REP(x,SIZE)REP(y,SIZE)REP(z,SIZE) (tmp[x][y] += a[x][z]*b[z][y]) %= MOD;
    REP(x,SIZE)REP(y,SIZE) a[x][y]=tmp[x][y];
}

void matmul(int a[SIZE][SIZE], int b[SIZE]) {
    int tmp[SIZE];
    REP(i,SIZE) tmp[i] = (a[i][0]*b[0] + a[i][1]*b[1]) % MOD;
    REP(i,SIZE) b[i]=tmp[i];
}

int M,K;
int A[SIZE][SIZE], ans[SIZE][SIZE];
void solve() {
    cin>>M>>K;
    REP(i,M)REP(j,M) {
        // iにjを足す
        {
            int k = (i+j)%M;
            A[i][k]++;
        }
        {
            // iにjをかける
            int k = (i*j)%M;
            A[i][k]++;
        }
    }
    REP(i,SIZE) ans[i][i]=1;
    REP(i,31) {
        if (K & (1LL<<i)) {
            matmul(ans, A);
        }
        matmul(A, A);
    }
    cout << ans[0][0] << endl;
}