#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>

using namespace std;

#define int long long
#define endl "\n"

constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007; 

struct fast_io {
	fast_io(){
		std::cin.tie(nullptr);
		std::ios::sync_with_stdio(false);
	};
} fio;

template<typename type>
vector<vector<type>> product(vector<vector<type>> &a, vector<vector<type>> &b){
	vector<vector<type>> res(a.size(),vector<type>(b[0].size(),0));
	
	
	for(int i = 0; i < a.size(); i++){
		for(int j = 0; j < b[0].size(); j++){
			for(int k = 0; k < b.size(); k++){ 
				res[i][j] += a[i][k]*b[k][j];
				res[i][j] %= MOD;
			}
		}
	}
	
	return res;
}

template<typename type>
vector<vector<type>> matrix_power(vector<vector<type>> matrix, long long n){
	vector<vector<type>> res(matrix.size(), vector<type>(matrix.size(),0));
	
	for(int i = 0; i < matrix.size(); i++) res[i][i] = 1;
	
	for( ; n > 0; n >>= 1){
		if(n&1) res = product(res,matrix);
		matrix = product(matrix,matrix);
	}
	
	return res;
}


signed main(){
	cout<<fixed<<setprecision(10);
	
	int M, K;
	vector<int> num;
	vector<vector<int>> ans, matrix;
	
	cin>>M>>K;
	
	ans.resize(M,vector<int>(1));
	matrix.resize(M,vector<int>(M));
	
	for(int i = 0; i < M; i++){
		for(int j = 0; j < M; j++){
			matrix[i*j%M][i]++;
			matrix[(i+j)%M][i]++;
		}
	}
	
	ans[0][0] = 1;
	
	matrix = matrix_power(matrix,K);
	ans = product(matrix,ans);
	
	cout<<ans[0][0]<<endl;
	 
	 
	return 0;
}