#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>
#include <fstream>

using namespace std;

#define REP(i, n) for(ll i = 0;i < n;i++)
#define REPR(i, n) for(ll i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define FORR(i, m, n) for(ll i = m;i >= n;i--)
#define REPO(i, n) for(ll i = 1;i <= n;i++)
#define ll long long
#define INF (ll)1 << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(),n.end()
#define MOD 1000000007
#define P pair<ll, ll>


ll n, p, s[2100000], sum[2100000], ans;

int main() {
	cin >> n >> p;
	s[0] = 0;
	s[1] = 1;
	FOR(i, 2, n) {
		s[i] = s[i - 1] * p % MOD + s[i - 2] % MOD;
	}
	REP(i, n) {
		sum[i] += s[i];
		sum[i] %= MOD;
		sum[i + 1] += sum[i];
	}
	REP(i, n) {
		ans += s[i] * sum[i] % MOD;
		ans %= MOD;
	}
	cout << ans << endl;
}