Jubilee

#include <bits/stdc++.h>
#define fi first
#define se second
#define For(type, i, a, b) for (type i = (a); i <= (b); ++i)
#define endl '\n'
using namespace std;
 
typedef long long ll;
 
const ll maxN = 1e18;
const ll minN = -1e18;
const ll MOD = 1e9 + 7;
 

ll n, m;

const ll mod = 1e9 + 7;

ll pow(ll a, ll n)
{
    a %= mod;
    if(n == 1) return a % mod;
    int tmp = pow(a % mod, n / 2);
    return (n & 1) ? tmp % mod * tmp % mod * a % mod : tmp % mod * tmp % mod;
}

void FastIn(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}
 
void ReadIn(){
  cin >> n >> m;
  ll res = ((m % mod * (m - 1) % mod) % mod * pow(m - 1, n - 1) % mod) % mod + ((m % mod * (m- 1) % mod) % mod * pow(((m - 2) % mod * (m - 2) % mod) % mod, n - 1) % mod) % mod;
  cout << res;
}
int main(){
    FastIn();
    ReadIn();
}
// g++ -o output
// g++ F.cpp
// ./f.out

Test 1

Verdict: ACCEPTED

Test 2

Verdict: RUNTIME ERROR

Test 3

Verdict: RUNTIME ERROR

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: RUNTIME ERROR

Test 10

Verdict: ACCEPTED

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: RUNTIME ERROR

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER