#include <bits/stdc++.h>
using namespace std;

template <int mod> struct ModInt {
    int x;

    ModInt() : x(0) {}
    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    ModInt &operator+=(const ModInt &p) {
        if((x += p.x) >= mod) x -= mod;
        return *this;
    }
    ModInt &operator-=(const ModInt &p) {
        if((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }
    ModInt &operator*=(const ModInt &p) {
        x = (int) (1LL * x * p.x % mod);
        return *this;
    }
    ModInt &operator/=(const ModInt &p) {
        *this *= p.inverse();
        return *this;
    }

    ModInt operator-() const { return ModInt(-x); }
    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }

    bool operator==(const ModInt &p) const { return x == p.x; }
    bool operator!=(const ModInt &p) const { return x != p.x; }

    ModInt inverse() const {
        int a = x, b = mod, u = 1, v = 0, t;
        while(b > 0) {
            t = a / b;
            swap(a -= t * b, b);
            swap(u -= t * v, v);
        }
        return ModInt(u);
    }

    friend ostream &operator<<(ostream &os, const ModInt &p) {
        return os << p.x;
    }
    friend istream &operator>>(istream &is, ModInt &a) {
        int64_t t;
        is >> t;
        a = ModInt<mod>(t);
        return (is);
    }

    static int get_mod() { return mod; }
};

template <typename T> T power(T a, long long n) {
    T r = 1;
    while(n > 0){
        if(n & 1) r *= a;
        a *= a;
        n >>= 1;
    }
    return r;
}

const int mod = int(1e9) + 7;
using mint = ModInt<mod>;

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

    int N, P; cin >> N >> P;
    mint ans = P - 1;
    ans *= power(mint(P-2), N-1);
    cout << ans << '\n';
    return 0;
}
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using pii = pair<int, int>;

int main() {
    cin.tie(0); ios::sync_with_stdio(0);
    LL n, p; cin >> n >> p;
    if (p == 2) {
        cout << (n==1 ? 1 : 0) << endl;
        return 0;
    }
    LL res = 1, top = n-1, base = p-2, mod = 1e9+7;
    while (top) {
        if (top & 1) res = res*base%mod;
        base = base*base%mod;
        top >>= 1;
    }
    res = res*(--p)%mod;
    cout << res << endl;

}