Jubilee

import sys
sys.setrecursionlimit(1_000_000_000)

n, m = input().split()
n = int(n)
m = int(m)

M = 1000000000 + 7

def modpow(n,m):
    # n**m = (n**(m/2)) ** 2
    if m == 0:
        return 1
    if m % 2 == 1:
        return n*modpow(n,m-1) % M
    k = modpow(n,m//2) % M
    return k*k % M

print((m * (m-1) * modpow((m-2)*(m-2) + m-1,n-1)) % M)

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