There are N balls placed in a row. AtCoDeer the deer is painting each of these in one of the K colors of his paint cans. For aesthetic reasons, any two adjacent balls must be painted in different colors.

Find the number of the possible ways to paint the balls.

Constraints

* 1≦N≦1000
* 2≦K≦1000
* The correct answer is at most 2^{31}-1.

Input

The input is given from Standard Input in the following format:


N K


Output

Print the number of the possible ways to paint the balls.

Examples

Input

2 2


Output

2


Input

1 10


Output

10
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  if (a % b == 0)
    return b;
  else
    return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
  long long c = gcd(a, b);
  return ((a / c) * (b / c) * c);
}
const long long INF = 1e18 + 7;
const long long MOD = 1e9 + 7;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  string a[3];
  cin >> a[0] >> a[1] >> a[2];
  (reverse(a[0].begin(), a[0].end()));
  (reverse(a[1].begin(), a[1].end()));
  (reverse(a[2].begin(), a[2].end()));
  char ans;
  char next = 'a';
  while (1) {
    if (a[next - 'a'].size() == 0) {
      ans = next;
      break;
    }
    int po = next - 'a';
    next = a[next - 'a'][a[next - 'a'].size() - 1];
    a[po].pop_back();
  }
  ans += ('A' - 'a');
  cout << ans << endl;
}
