#include <iostream>
#include <iomanip>
#include <vector>
#include <utility>
#include <map>
#include <algorithm>
#include <queue>
#include <cmath>
#include <numeric>
#include <set>

using namespace std;
struct aaa{aaa(){cin.tie(nullptr); ios::sync_with_stdio(false); cout<<fixed<<setprecision(20);};}aaa;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v){o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
#define debug(v) {cerr<<"\033[1;36m[debug]\033[m "<<#v<<" : "<<v<<endl;}

using int64 = long long;
const int MOD = 1000000007;
struct mint {
    long long x;
    explicit mint(const long long x=0) : x(x%MOD) {}

    mint& operator+=(const mint a) { if ( (x+=a.x) >= MOD) x-=MOD; return *this; }
    mint& operator-=(const mint a) { if ( (x+= MOD-a.x) >= MOD) x-= MOD; return *this; }
    mint& operator*=(const mint a) { (x*=a.x) %= MOD; return *this; }
    mint& operator/=(const mint a) { return (*this) *= a.inv();}
    mint operator+(const mint a) const { mint res(*this); return res+=a; }
    mint operator-(const mint a) const { mint res(*this); return res-=a; }
    mint operator*(const mint a) const { mint res(*this); return res*=a; }
    mint operator/(const mint a) const {mint res(*this); return res/=a;}
    mint inv() const { return pow(MOD-2);}
    friend ostream& operator<<(ostream &os, const mint a) noexcept { return os << a.x; }
    constexpr bool operator == (const mint& r) const noexcept { return this->x == r.x; }
    constexpr bool operator != (const mint& r) const noexcept { return this->x != r.x; }
    mint pow(long long t) const {
        if (!t) return mint(1);
        mint a = pow(t>>1);
        a*=a;
        if(t&1) a*= *this;
        return a;
    }
};

vector<mint> _fibo;

mint fibo(int64 n, mint p) {
    if (n <= 1) return mint(0);
    if (_fibo[n] != mint(0)) return _fibo[n];
    mint res = (p * fibo(n-1, p)) + fibo(n-2, p);
    return _fibo[n] = res;
}

int main() {
    int64 n,p;
    cin >> n >> p;
    mint ans(0);
    _fibo = vector<mint> (n+10);
    for (int i=0; i<n; i++) {
        _fibo[i] = mint(0);
    }
    _fibo[0] = mint(0); _fibo[1] = mint(0); _fibo[2] = mint(1);

    mint pm(p);
    vector<mint> wa(n+1);
    mint sum(0);
    for (int i=1; i<=n; i++) {
        mint f = fibo(i, pm);
        sum += f;
        ans += f * sum;
    }
    cout << ans << endl;
}