/*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
template <class H,class... T>
void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}
ll sum[2000010] = {};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll N,p;
    cin >> N >> p;
    vector<ll> v;
    v.push_back(0);
    v.push_back(1);
    ll c1 = 1, c2 = 0;

    rep(i,3,N+1){
        ll val = p * c1 % MOD + c2;
        val %= MOD;
        v.push_back(val);
        c2 = c1;
        c1 = val;
    }
    rep(i,0,N){
        sum[i+1] = sum[i] + v[i];
        sum[i+1] %= MOD;
    }
    ll ans = 0;
    rep(i,0,N){
        ans += v[i] * sum[i+1] % MOD;
        ans %= MOD;
    }
    print(ans);

    

}