Jubilee

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

long long p = 1000000007;

long long power(long long x, long long n) {
  if(n == 0) return (1 % p);
  long long xx = power(x, n/2);
  xx = (xx * xx) % p;
  if(n%2==1) xx = (xx * x) % p;
  return xx;
}

int main() {
  long long n, m;
  cin >> n >> m;
  
  long long dp[n+1];
  dp[1] = ((m * (m-1))) % p; 
  for(int i=2; i<=n; i++) {
    long long foo = ((m-1) * (m-1)) % p;
    foo = (foo + p - m + 2) % p;
    dp[i] = (dp[i - 1] * foo) % p;
  }
  cout << dp[n] << endl;
  return 0;
}

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