#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
#define PI 3.141592653589793

int main(){
  ll N, p; cin >> N >> p; ll a[N], cum[N+1]; 
  a[0]=0; a[1]=1; cum[0]=0, cum[1]=0, cum[2]=1;
  rep(i, N-2){
    int Q; Q = a[i+1]*p%mod;
    a[i+2] = a[i] + Q; a[i+2]%=mod;
    cum[i+3] = cum[i+2] + a[i+2]; cum[i+3]%=mod;
  }
  ll ans = 0;
  rep(i, N){
    ll K = cum[N] - cum[i];
    if(K<0) K+=mod; K%=mod;
    ll A = a[i]*K; A%=mod;
    ans+=A; ans%=mod;
  }
  cout << ans << endl;
}