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;
const int INF = 1e9 + 5;
const int MAXN = 3e6 + 123;
void faster() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
bool cmp(const string& a, const string& b) { return (a + b) < (b + a); }
vector<int> Reversed(const vector<int>& s) {
  vector<int> d = s;
  reverse((d).begin(), (d).end());
  return d;
}
void solve() {
  int n, k;
  cin >> n >> k;
  int mn = min(n, k);
  cout << n * k / mn;
}
int main() {
  int n = 1;
  while (n--) {
    solve();
  }
}
