#define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <sstream>
#include <string>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <numeric>
#include <functional>
#include <cctype>
#include <list>
#include <limits>
#include <cassert>
#include <random>
#include <time.h>
#include <unordered_set>

using namespace std;
using Int = long long;

constexpr double EPS = 1e-10;
constexpr long long MOD = 1000000007;

long long mod_pow(long long x, long long n) {
    long long res = 1;
    for (int i = 0;i < 60; i++) {
        if (n >> i & 1) res = res * x % MOD;
        x = x * x % MOD;
    }
    return res;
}

long long my_mod_pow(long long x, long long n) {
	long long ret = 1;
	for (; n > 0; n >>= 1, x = x * x % MOD) {
		if (n & 1) {
			ret = ret * x % MOD;
		}
	}
	return ret;
}

template<typename T>
T gcd(T a, T b) {
    return b != 0 ? gcd(b, a % b) : a;
}

template<typename T>
T lcm(T a, T b) {
    return a * b / gcd(a, b);
}

void fastInput() {
    cin.tie(0);
    ios::sync_with_stdio(false);
}

int main(void) {
    int N; cin >> N;
    long long P; cin >> P; 
    vector<long long> A(N+1);
    A[1] = 0;
    A[2] = 1;
    for (int i = 3; i <= N; i++) {
        A[i] = P * A[i-1] % MOD + A[i-2];
        A[i] %= MOD; 
    }
    vector<long long> imos(N+1);
    for (int i = 1; i <= N; i++) {
        imos[i] = A[i] + imos[i-1];
        imos[i] %= MOD;
    }

    long long ans = 0;
    for (int i = 1; i <= N; i++) {
        long long sum = (imos[N] - imos[i-1] + MOD) % MOD;
        ans += sum * A[i] % MOD;
        ans %= MOD;
    }
    cout << ans << endl;
}