#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define mod 1000000007
using ll = long long;
using namespace std;
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  ll N; cin >> N;
  ll p; cin >> p;
  vector<ll> fib(N);
  fib[0] = 0; fib[1] = 1;
  for(int i=2; i<N; i++){
    fib[i]=(fib[i-1]*p+fib[i-2])%mod;
  }
  vector<ll> sums(N+1,0);
  rep(i,N) sums[i+1] = (sums[i] + fib[i])%mod;
  ll ans = 0;
  rep(i,N){
    ans += fib[i]*sums[i+1];
    ans %= mod;
  }
  cout << ans << endl;
  return 0;
}