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

using ll = long long;
const ll MOD = 1e9 + 7;

// A*B(行列の掛け算, 各項はmで割った余り)
vector<vector<ll>> mul(vector<vector<ll>> &A, vector<vector<ll>> &B, ll m) {
  vector<vector<ll>> C(A.size(), vector<ll>(B[0].size(), 0));
  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] = (C[i][j] + A[i][k] * B[k][j]) % m;
      }
    }
  }
  return C;
}

// A^n(行列累乗, 各項はmで割った余り)
vector<vector<ll>> power(vector<vector<ll>> A, ll n, ll m) {
  vector<vector<ll>> B(A.size(), vector<ll>(A.size(), 0));
  for (int i = 0; i < A.size(); i++) B[i][i] = 1;
  
  while (n > 0) {
    if (n & 1) B = mul(B, A, m);
    A = mul(A, A, m);
    n >>= 1;
  }
  return B;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  
  ll m, k;
  cin >> m >> k;
  
  vector<vector<ll>> x(m, vector<ll>(m));
  for (int i = 0; i < m; i++) {
    for (int j = 0; j < m; j++) {
      int nextp = (i + j) % m;
      int nextm = (i * j) % m;
      x.at(i).at(nextp)++;
      x.at(i).at(nextm)++;
    }
  }
  
  vector<vector<ll>> y = power(x, k, MOD);
  
  cout << y.at(0).at(0) % MOD << '\n';
}