#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
#define ll long long
ll mod = 1e9+7;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll binpow(ll a, ll b)
{
ll res = 1;
while (b>0)
{
if (b&1)
res = (res*a)%mod;
a = (a*a)%mod;
b>>=1;
}
return res;
}
ll gcd(ll x, ll y)
{
if (y==0)
return x;
return gcd(y, x%y);
}
void solve()
{
ll n,k;
cin>>n>>k;
if (k<n)
{
cout<<0<<endl;
return;
}
ll sum = 0;
ll val = 1;
ll p = 0;
for (int i=1 ; i<=n ; i++)
{
ll temp = val;
val += p;
p = temp;
}
ll res = binpow(binpow(k, n), mod-2);
cout<<(res*val)%mod;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ll tt = 1;
// cin>>tt;
while (tt--)
{
solve();
}
return 0;
}
