#include<bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)

template<ULL M>
struct modint {
    ULL x;
    modint(ULL val = 0) : x(val) {}

    modint& operator+=(modint r) { x += r.x; if (x >= M) x -= M; return *this; }
    modint operator+(modint r) const { modint res = x; return res += r; }
    modint& operator-=(modint r) { x += M - r.x; if (x >= M) x -= M; return *this; }
    modint operator-(modint r) const { modint res = x; return res -= r; }
    modint& operator*=(modint r) { x = x * r.x % M; return *this; }
    modint operator*(modint r) const { return modint(x * r.x % M); }
    modint pow(ULL r) const {
        if (r == 0) return modint(1);
        modint res = pow(r / 2);
        res *= res;
        if (r % 2) res *= *this;
        return res;
    }
    modint& operator/=(modint r) { *this *= r ^ (M - 1); return *this; }
    modint operator/(modint r) const { return *this * (r.pow(M - 2)); }
    ULL& operator*() { return x; }
    const ULL& operator*() const { return x; }
};

const ULL M = 1000000007;
using MLL = modint<M>;

int main() {
    ULL N, K; cin >> N >> K;
    MLL mK = K % M;

    MLL ans = 0;
    ans += (mK * (mK + 3) / 2).pow(N);
    ans -= (mK * (mK + 1) / 2).pow(N);
    cout << *ans << endl;

    return 0;
}