#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
const ll MOD = 1000000007;
const ll INF = 2147483647;
const ll LINF = 9223372036854775807;
#define REP(i, n) for(int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()

int main() {
	ll n, p; cin >> n >> p;
	VI a(n); a[0] = 0; a[1] = 1;
	REP(i, n - 2)a[i + 2] = (((p * a[i + 1]) % MOD) + a[i]) % MOD;
	VI r(n + 1); r[0] = 0;
	REP(i, n)r[i + 1] = (r[i] + a[i]) % MOD;
	ll ans = 0;
	REP(i, n) {
		ans += (a[i] * r[i + 1]) % MOD;
		ans %= MOD;
	}
	cout << ans << endl;
	return 0;
}