#include <cstdio>
#include <climits>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <string>
#include <cstdio>
#include <climits>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <utility>
#include <queue>
#include <cstring>
#include <set>
#include <map>
#include <complex>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
long long MOD = 1000000007;
long long INF = 1000000000000000; //10^15
typedef long long ll;
typedef unsigned long long ull;


ll powMod(ll x, ll n, ll mod) {
  if (n == 0) return 1;
  ll t = powMod(x, n/2, mod);
  t = t * t % mod;
  if (n & 1) return t * x % mod;
  return t;
}

ll a[2001000];ll sum[2001000] = {};ll c[2001000] = {};

int main(void) {
  
  int n; ll p;
  cin >> n >> p;
  
  a[1] = 0; a[2] = 1;
  for (int i = 3; i <= n; i++) {
    a[i] = ((p*a[i-1]%MOD) + a[i-2])%MOD;
  }
  
  for (int i = 1; i <= n; i++) {
    sum[i] = (sum[i - 1] + a[i])%MOD;
  }
  
  for (int i = 1; i <= n; i++) {
    c[i] = (c[i - 1] + (a[i]*sum[i]%MOD))%MOD;
  }
  cout << c[n] << endl;

  return 0;
}