#include <iostream>
using namespace std;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define REP(i, n) FOR(i,0,n)

#include <atcoder/modint>
using mint = atcoder::modint1000000007;

int main() {
    cin.tie(nullptr), ios::sync_with_stdio(false);

    int K, N;
    cin >> K >> N;

    if (K == 0) {
        cout << N << '\n';
        return 0;
    }

    const int M = max(0, N - 2), U = max(0, N - 3);

    mint g = N - 1, h = N - 1, i = M, j = N - 1, k = M, l = U;

    REP(_, K - 1) {
        mint gnxt = g * (h * h + i * i * (N - 1));
        mint hnxt = j * h * h + k * i * i * (N - 1);
        mint inxt = h * k * i * 2 + l * i * i * M;
        mint jnxt = j * j * j + k * k * k * (N - 1);
        mint knxt = j * k * k + k * k * k + k * l * l * M;
        mint lnxt = l * k * k * 3 + l * l * l * U;
        g = gnxt;
        h = hnxt;
        i = inxt;
        j = jnxt;
        k = knxt;
        l = lnxt;
    }
    cout << (g * g * g * N).val() << '\n';
}