#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996) 

typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
using namespace std;

ll mpow(ll x, ll n){ //x^n(mod M)
    ll ans = 1;
    while(n != 0){
        if(n&1) ans = ans*x % MOD;
        x = x*x % MOD;
        n = n >> 1;
    }
    return ans;
}

ll minv(ll x){
    return mpow( x, MOD-2 );
}

int main(int argc, char* argv[])
{
    int n,p;
    scanf("%d%d", &n, &p);

    ll sum1=0, sum2=0;
    vector<ll> a(n+1);
    int i;
    for(i=1; i<=n; i++) {
        if(i==1) {
            a[i]=0;
        }
        else if(i==2) {
            a[i]=1;
        }
        else {
            a[i]=(p*a[i-1]+a[i-2])%MOD;
        }
        sum1=(sum1+a[i])%MOD;
        sum2=(sum2+a[i]*a[i])%MOD;
    }
    ll ans = (sum1*sum1 + sum2 + MOD)%MOD;
    ans = ans * minv(2) % MOD;
    printf("%lld\n", ans);

    return 0;
}