#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvv vector<vvl>
#define vvi vector<vector<int> >
#define vvl vector<vector<ll> >
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvvl(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define rep(c, a, b) for(ll c=a;c<b;c++)
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

int main(int argc, char const *argv[]) {
  ll n, p;std::cin >> n >> p;
  ll P = 1000000007;
  vll a(n, 0), s(n, 0);
  a[0] = 0, a[1] = 1;
  rep(i, 2, n) a[i] = ((p*a[i-1])%P + a[i-2])%P;
  re(i, n) s[i] = ((i==0?0:s[i-1]) + a[i])%P;
  ll ans = 0;
  re(i, n){
    ans = (ans + (a[i]*s[i])%P)%P;
  }
  std::cout << ans << '\n';
  return 0;
}