#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
long long MOD = 1e9 + 7;
long long M, K;
vector<vector<long long>> gyo(vector<vector<long long>> a, vector<vector<long long>> b){
    vector<vector<long long>> A(M, vector<long long> (M));
    for(int i = 0; i < M; i++){
        for(int j = 0; j < M; j++){
            long long res = 0;
            for(int k = 0; k < M; k++){
                res += a[i][k]*b[k][j] % MOD;
                res %= MOD;
            }
            A[i][j] = res;
        }
    }
    return A;
}
vector<vector<long long>> repow(vector<vector<long long>> a, long long b){
    vector<vector<long long>>  B(M, vector<long long> (M));
    if(b == 1) return a;
    if(b % 2 == 0){
        B = repow(a, b/2);
        return gyo(B, B);
    }
    else return gyo(repow(a, b - 1), a);
}
int main(){
    cin >> M >> K;
    vector<vector<long long>> dp(M, vector<long long>(M,0));
    for(int i = 0; i < M; i++){
        for(int j = 0; j < M; j++){
            dp[i*j%M][i]++;
            dp[(i + j)%M][i]++;
        }
    }
    vector<vector<long long>> ans;
    ans = repow(dp, K);
    cout << ans[0][0] << endl;
}