#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<ll>>;
ll mod=1e9+7;
vll DP(1e5+7,-1);

ll DF(ll M){
    if(DP[M]!=-1)return DP[M];
    ll res=0;
    for(ll i=1;i*i<=M;i++){
        if(M%i==0){
            res+=DF(M/i-1);
            res%=mod;
            if(M!=i*i){
                res+=DF(i-1);
            }
        }
    }    
    DP[M]=res;
    return res;
}
int main() {
    ll N,P;
    cin>>N>>P;
    vll A(N+3);
    A[0]=0,A[1]=1;
    ll S=0,D=0;
    rep(i,N-2){
        A[i+2]=A[i+1]*P+A[i];
        A[i+2]%=mod;
    }
    rep(i,N){
        S+=A[i];
        D+=A[i]*A[i];
        S%=mod;
        D%=mod;
    }
    ll AN=S*S;
    AN%=mod;
    AN+=D;
    AN+=mod;
    AN%=mod;
    AN*=(mod+1)/2;
    AN%=mod;
    cout<<AN<<endl;

}