#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;

int main(){
  int N;
  ll P;
  cin>>N>>P;

  vector<ll> A(N,0);
  A[0]=0;
  A[1]=1;
  for(int i=2;i<N;i++) A[i]=(P*A[i-1]%MOD+A[i-2])%MOD;

  ll sum=0;
  ll ans=0;
  rep(i,N){
    sum=(sum+A[i])%MOD;
    ans=(ans+sum*A[i]%MOD)%MOD;
  }

  cout<<ans<<endl;

  return 0;
}