import java.io.BufferedReader import java.io.InputStream import java.io.InputStreamReader import java.util.* import kotlin.math.abs import kotlin.math.max import kotlin.math.min val MOD = 1_000_000_007 fun powMat(a: Array, n: Long, mod: Int): Array { if (n == 1L) return a val res = powMat(mulMat(a, a, mod), n / 2, mod) return if (n % 2 == 1L) mulMat(res, a, mod) else res } fun mulMat(a: Array, b: Array, mod: Int): Array { assert(a[0].size == b.size) val len = a[0].size val h = a.size val w = b[0].size val res = Array(h){LongArray(w)} val th = 7e18.toLong() for (i in 0 until h) { for (j in 0 until w) { var v = 0L for (k in 0 until len) { v += a[i][k] * b[k][j] if (v > th) v %= mod } res[i][j] = if (v >= mod) v % mod else v } } return res } class Solver(stream: InputStream, private val out: java.io.PrintWriter) { fun solve() { out.println(solve2()) } fun solve2(): Long { val M = ni() val K = nl() val A = Array(M) {LongArray(M)} for (i in 0 until M) { for (j in 0 until M) { A[i][(i + j) % M]++ A[i][i * j % M]++ } } val B = powMat(A, K, MOD) // debugDim(B) // for (i in 0 until K) { // dp[i + 1][0] = (dp[i][0] * (P + 1) + dp[i][1] * 2) % MOD // dp[i + 1][1] = (dp[i][0] * (P - 1) + dp[i][1] * (P - 1) * 2) % MOD // debug(dp[i + 1]) // } // return dp[K][0] return B[0][0] } private val isDebug = try { // なんか本番でエラーでる System.getenv("MY_DEBUG") != null } catch (t: Throwable) { false } private var tokenizer: StringTokenizer? = null private val reader = BufferedReader(InputStreamReader(stream), 32768) private fun next(): String { while (tokenizer == null || !tokenizer!!.hasMoreTokens()) { tokenizer = StringTokenizer(reader.readLine()) } return tokenizer!!.nextToken() } private fun ni() = next().toInt() private fun nl() = next().toLong() private fun ns() = next() private fun na(n: Int, offset: Int = 0): IntArray { return map(n) { ni() + offset } } private fun nal(n: Int, offset: Int = 0): LongArray { val res = LongArray(n) for (i in 0 until n) { res[i] = nl() + offset } return res } private fun na2(n: Int, offset: Int = 0): Array { val a = Array(2){IntArray(n)} for (i in 0 until n) { for (e in a) { e[i] = ni() + offset } } return a } private inline fun map(n: Int, f: (Int) -> Int): IntArray { val res = IntArray(n) for (i in 0 until n) { res[i] = f(i) } return res } private inline fun debug(msg: () -> String) { if (isDebug) System.err.println(msg()) } private fun debug(a: LongArray) { debug { a.joinToString(" ") } } private fun debug(a: IntArray) { debug { a.joinToString(" ") } } private fun debug(a: BooleanArray) { debug { a.map { if (it) 1 else 0 }.joinToString("") } } private fun debugDim(A: Array) { if (isDebug) { for (a in A) { debug(a) } } } /** * 勝手にimport消されるのを防ぎたい */ private fun hoge() { min(1, 2) max(1, 2) abs(-10) } } fun main() { val out = java.io.PrintWriter(System.out) Solver(System.`in`, out).solve() out.flush() }