#include<bits/stdc++.h>
   
using namespace std;
  
#define rep(i,n) for(int i=0;i<(n);++i)
#define reps(i,n) for(int i=1;i<=(n);++i)
#define all(x) (x).begin(),(x).end()
#define Fixed fixed << setprecision(14)
#define int int64_t
using pii = pair<int,int>;
constexpr int INF  = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr int mod = 1e9+7; 
constexpr int MOD = 998244353;
 
template <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }
template <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }
 
template <class T> using min_heap = priority_queue<T,vector<T>,greater<T> >;
template <class T> using max_heap = priority_queue<T>;
template <class A,class B> using umap = unordered_map<A,B>;
   
int gcd(int a,int b){ return b ? gcd(b,a % b) : a;}
int lcm(int a,int b){ return a / gcd(a,b) * b;}


signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n,p;
    cin >> n >> p;
    vector<int> a(n+5),cum(n+5);
    a[1] = 0;
    a[2] = 1;
    cum[1] = 0;
    cum[2] = 1;

    for(int i = 3;i <= n;++i){
        (a[i] = p * a[i-1]) %= mod;
        (a[i] += a[i-2]) %= mod;
        cum[i] = a[i];
        (cum[i] += cum[i-1]) %= mod;
    }

    int res = 0;
    reps(i,n){
        int tmp = a[i] * cum[i] % mod;
        (res += tmp) %= mod;
    }

    cout << res << '\n';

    return 0;
}