Problem: Little Petya very much likes strings. Recently he has received a voucher to purchase a string as a gift from his mother. The string can be bought in the local shop. One can consider that the shop has all sorts of strings over the alphabet of fixed size. The size of the alphabet is equal to k. However, the voucher has a string type limitation: specifically, the voucher can be used to purchase string s if the length of string's longest substring that is also its weak subsequence (see the definition given below) equals w.

String a with the length of n is considered the weak subsequence of the string s with the length of m, if there exists such a set of indexes 1 ≤ i1 < i2 < ... < in ≤ m, that has the following two properties: 

  * ak = sik for all k from 1 to n; 
  * there exists at least one such k (1 ≤ k < n), for which ik + 1 – ik > 1. 



Petya got interested how many different strings are available for him to purchase in the shop. As the number of strings can be very large, please find it modulo 1000000007 (109 + 7). If there are infinitely many such strings, print "-1".

Input

The first line contains two integers k (1 ≤ k ≤ 106) and w (2 ≤ w ≤ 109) — the alphabet size and the required length of the maximum substring that also is the weak subsequence, correspondingly.

Output

Print a single number — the number of strings Petya can buy using the voucher, modulo 1000000007 (109 + 7). If there are infinitely many such strings, print "-1" (without the quotes).

Examples

Input

2 2


Output

10


Input

3 5


Output

1593


Input

2 139


Output

717248223

Note

In the first sample Petya can buy the following strings: aaa, aab, abab, abb, abba, baa, baab, baba, bba, bbb.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int mo = 1000000007;
const int N = 1000005;
int k, n, ans;
int fac[N], inv[N];
int power(int x, int y) {
  int s = 1;
  if (y < 0) y += mo - 1;
  for (; y; y /= 2, x = 1ll * x * x % mo)
    if (y & 1) s = 1ll * s * x % mo;
  return s;
}
int F(int l1, int l2) {
  if (l1 > k) return 0;
  if (l1 + l2 <= n + l2) {
    int ans = power(k, n - l1 - 1);
    ans = 1ll * ans * fac[k] % mo * inv[k - l2] % mo * l2 % mo;
    ans = 1ll * ans * fac[k] % mo * inv[k - l1] % mo;
    return ans;
  } else {
    int ans = 1;
    ans = 1ll * ans * fac[k] % mo * inv[k - l1] % mo;
    ans = 1ll * ans * (n + l2 - l1) % mo * fac[k - l1 + n - 1] % mo *
          inv[k - l2] % mo;
    return ans;
  }
}
int main() {
  scanf("%d%d", &k, &n);
  fac[0] = inv[0] = inv[1] = 1;
  for (int i = (int)(2); i <= (int)(N - 1); i++)
    inv[i] = 1ll * inv[mo % i] * (mo - mo / i) % mo;
  for (int i = (int)(1); i <= (int)(N - 1); i++)
    inv[i] = 1ll * inv[i - 1] * inv[i] % mo;
  for (int i = (int)(1); i <= (int)(N - 1); i++)
    fac[i] = 1ll * fac[i - 1] * i % mo;
  for (int ex = (int)(1); ex <= (int)(k); ex++)
    ans = (1ll * ans + F(ex, ex) + F(ex + 1, ex)) % mo;
  printf("%d\n", ans);
}