#include <bits/stdc++.h>

#include <atcoder/modint>

#include <assert.h>

#include <vector>

template <class T>
struct Matrix {
    std::vector<std::vector<T>> a;

    Matrix(int n, int m) : a(n, std::vector<T>(m, 0)) {}
    Matrix(int n) : a(n, std::vector<T>(n, 0)) {}

    int height() const { return a.size(); }
    int width() const { return a[0].size(); }

    inline const std::vector<T> &operator[](int i) const { return a[i]; }
    inline std::vector<T> &operator[](int i) { return a[i]; }

    static Matrix id(int n) {
        Matrix res(n);
        for (int i = 0; i < n; i++) res[i][i] = 1;
        return res;
    }

    Matrix &operator*=(const Matrix &b) {
        assert(width() == b.height());
        std::vector<std::vector<T>> c(height(), std::vector<T>(b.width()));
        for (int i = 0; i < height(); ++i) {
            for (int k = 0; k < b.height(); ++k) {
                for (int j = 0; j < b.width(); ++j) {
                    c[i][j] += a[i][k] * b[k][j];
                }
            }
        }
        a.swap(c);
        return *this;
    }

    Matrix pow(long long n) const {
        Matrix x(height(), width());
        for (int i = 0; i < height(); i++) {
            for (int j = 0; j < width(); j++) {
                x[i][j] = a[i][j];
            }
        }

        auto res = id(height());
        while (n) {
            if (n & 1) {
                res *= x;
                --n;
            } else {
                x *= x;
                n >>= 1;
            }
        }
        return res;
    }

    Matrix operator*(const Matrix &b) const { return Matrix(*this) *= b; }
    std::vector<T> operator*(const std::vector<T> &v) {
        assert(width() == (int)v.size());
        std::vector<T> res(height(), 0);
        for (int i = 0; i < height(); ++i) {
            for (int j = 0; j < width(); ++j) {
                res[i] += a[i][j] * v[j];
            }
        }
        return res;
    }
};


#include <algorithm>
#include <cassert>
#include <vector>

template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <class T>
T div_floor(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a >= 0 ? a / b : (a + 1) / b - 1;
}

template <class T>
T div_ceil(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a > 0 ? (a - 1) / b + 1 : a / b;
}

template <typename T>
struct CoordComp {
    std::vector<T> v;
    bool sorted;

    CoordComp() : sorted(false) {}

    int size() { return v.size(); }

    void add(T x) { v.push_back(x); }

    void build() {
        std::sort(v.begin(), v.end());

        v.erase(std::unique(v.begin(), v.end()), v.end());
        sorted = true;
    }

    int get_idx(T x) {
        assert(sorted);
        return lower_bound(v.begin(), v.end(), x) - v.begin();
    }

    T &operator[](int i) { return v[i]; }
};


#define For(i, a, b) for (int i = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For(i, 0, n)
#define rrep(i, n) rFor(i, n, 0)
#define fi first
#define se second

using namespace std;

using lint = long long;
using pii = pair<int, int>;
using pll = pair<lint, lint>;

using namespace atcoder;
using mint = modint1000000007;

int main() {
    int m, K;
    scanf("%d%d", &m, &K);
    Matrix<mint> a(m);
    rep(i, m) rep(j, m) {
        ++a[(i + j) % m][i];
        ++a[(i * j) % m][i];
    }
    a = a.pow(K);
    printf("%u\n", a[0][0].val());
}