#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define mt make_tuple
#define ALL(a) (a).begin(),(a).end()
#define FST first
#define SEC second
#define DEB cerr<<"!"<<endl
#define SHOW(a,b) cerr<<(a)<<" "<<(b)<<endl
#define vi vector<int>

using ll = long long;
const int INF = (INT_MAX/2);
const ll LLINF = (LLONG_MAX/2);
const double eps = 1e-8;
const ll DIV =1e9+7;
//const double PI = M_PI;
inline ll pow(ll x,ll n,ll m){ll r=1;while(n>0){if((n&1)==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;}
inline ll lcm(ll d1, ll d2){return d1 / __gcd(d1, d2) * d2;}
#define chmax(a,b) a=max(a,b)

/*Coding Space*/
ll num[2000001];
ll snum[2000001];
int main(){
  num[0] = 0; num[1] = 1;
  ll n,p; cin >> n >> p;
  for(int i = 2; i < n; ++i){
    num[i] = p * num[i-1]; num[i] %= DIV;
    num[i] += num[i-2]; num[i] %= DIV;
  }
  snum[0] = 0;
  for(int i = 1; i < n; ++i){
    snum[i] += num[i] + snum[i-1];
    snum[i] %= DIV;
  }

  ll ans = 0;
  rep(i,n){
    ans += num[i] * snum[i];
    ans %= DIV;
  }
  //rep(i,5) cout << num[i] << ' ' << snum[i] << endl;
  cout << ans << endl;
}