Jubilee

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

using ll = long long;

const ll mod = 1e9 + 7;


int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; ll m;
	cin >> n >> m;
	if (m == 1) {
		cout << "0\n";
		return 0;
	}
	ll ans = (m * (m - 1)) % mod;
	for (int _ = 1; _ < n; ++_) {
		ll times = 1 + 2ll * (m - 2);
		times %= mod;
		times += ((m - 2) * (m - 3)) % mod;
		times %= mod;
		ans = (ans * times) % mod;
	}

	cout << ans << "\n";
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED