#include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9 + 7;
long long power(long long base, long long exp) {
long long res = 1;
base %= MOD;
while (exp > 0) {
if (exp % 2 == 1) res = (res * base) % MOD;
base = (base * base) % MOD;
exp /= 2;
}
return res;
}
long long modInverse(long long n) {
return power(n, MOD - 2);
}
struct Matrix {
long long mat[2][2];
Matrix() {
mat[0][0] = mat[0][1] = mat[1][0] = mat[1][1] = 0;
}
};
Matrix multiply(Matrix A, Matrix B) {
Matrix C;
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++)
for (int k = 0; k < 2; k++)
C.mat[i][j] = (C.mat[i][j] + A.mat[i][k] * B.mat[k][j]) % MOD;
return C;
}
Matrix matrix_power(Matrix A, long long p) {
Matrix res;
res.mat[0][0] = 1; res.mat[1][1] = 1;
while (p > 0) {
if (p & 1) res = multiply(res, A);
A = multiply(A, A);
p >>= 1;
}
return res;
}
int main() {
long long n, k;
if (!(cin >> n >> k)) return 0;
if (k < n) {
cout << 0 << endl;
return 0;
}
Matrix T;
T.mat[0][0] = 1; T.mat[0][1] = 1;
T.mat[1][0] = 1; T.mat[1][1] = 0;
T = matrix_power(T, n);
long long Fn = T.mat[0][0];
long long total_outcomes = power(k, n);
long long ans = (Fn * modInverse(total_outcomes)) % MOD;
cout << ans << endl;
return 0;
}
