#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const ll MOD = 1000000007;

ll modpow(ll x, ll n, ll mod = MOD) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    ll p;
    cin >> p;
    if (n == 1) {
        cout << 0 << endl;
        return 0;
    }

    ll a1 = 0, a2 = 1;
    ll ans = a1 * a1 + a2 * a1 + a2 * a2;
    ll sum = a1 + a2;
    for (int i = 3; i <= n; ++i) {
        ll a3 = (a2 * p % MOD + a1) % MOD;
        a1 = a2;
        a2 = a3;
        (sum += a2) %= MOD;
        (ans += sum * a2 % MOD) %= MOD;
    }
    cout << ans << "\n";
    return 0;
}