#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair pii; typedef pair pll; const int INF = 1e9; const ll LINF = 1e18; template ostream& operator << (ostream& out,const pair& o){ out << "(" << o.first << "," << o.second << ")"; return out; } template ostream& operator << (ostream& out,const vector& V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; } template ostream& operator << (ostream& out,const vector >& Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; } template ostream& operator << (ostream& out,const map& mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; } templatevector make_v(size_t a){return vector(a);} templateauto make_v(size_t a,Ts... ts){return vector(ts...))>(a,make_v(ts...));} template typename enable_if::value==0>::type fill_v(T &t,const V &v){t=v;} template typename enable_if::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);} /* 問題文============================================================ ================================================================= 解説============================================================= ================================================================ */ constexpr ll MOD = 1e9+7; template Type solve(Type res = Type()){ ll N,p; cin >> N >> p; ll sumA = 0; vector a(N+1); a[1] = 0; a[2] = 1; for(int n = 3; n <= N;n++){ a[n] = p*a[n-1] + a[n-2]; a[n] %= MOD; } for(int n = 1; n <= N;n++){ sumA += a[n]; sumA %=MOD; res += a[n] * sumA %MOD; res %=MOD; } return res; } int main(void) { cin.tie(0); ios::sync_with_stdio(false); //solve(0); cout << fixed << setprecision(12) << solve() << endl; return 0; }