#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <deque>
#include <string>
#include <stack>
#include <vector>
#include <set>
#include <tuple>
#include <utility>
#include <functional>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
const int INF = 1000000000;
const int MOD = 1000000007;
int main(){
	int n;
	cin >> n;
	ll p;
	cin >> p;
	vector<ll> a(n);
	a[0] = 0;
	a[1] = 1;
	for(int i = 2;i < n;i++){
		a[i] = (p * a[i-1]) % MOD + a[i-2];
		a[i] %= MOD;
	}

	vector<ll> sum(n);
	sum[n-1] = a[n-1];
	for(int i = n-2;i >= 0;i--){
		sum[i] = sum[i+1] + a[i];
		sum[i] %= MOD;
	}

	ll ans = 0;
	for(int i = 0;i < n;i++){
		ans += sum[i] * a[i];
		ans %= MOD;
	}

	cout << ans << endl;
}