#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
  return '"' + s + '"';
}
string to_string(const char* s) {
  return to_string((string) s);
}
string to_string(bool b) {
  return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cout << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cout << " " << to_string(H);
  debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cout << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
const long long mod = 1e9+7; // CHECK
long long power(long long a, long long b, long long m = mod) {
    if(b < 0) {
        return power(power(a, -b), mod-2);
    }
    long long x = 1;
    while(b) {
        if(b & 1) {
            x = 1ll * x * a % m;
        }
        a = 1ll * a * a % m;
        b /= 2;
    }
    return x;
}
#define ll long long
const int INT_INF = 1e9+9;
const ll LL_INF = 2e18;
const int N = 3e5+9; // check N, mod
const int M = 5e5+9;
long long fact[M], ifact[M], inv[M];
long long ncr(long long n, long long r) {
    assert(n < M);
    if(r < 0 || n < 0 || r > n) return 0;
    long long ret = fact[n] * ifact[n-r] % mod * ifact[r] % mod;
    return ret;
}
long long npr(long long n, long long r) {
    assert(n < M);
    if(r < 0 || n < 0 || r > n) return 0;
    // if (r == 0) return 1;
    long long ret = fact[n] * ifact[n-r] % mod;
    return ret;
}
ll sqr(ll t) {return t * t % mod;}
signed main() {  
    ios_base::sync_with_stdio(false); 
    cin.tie(0); cout.tie(0);
    inv[1] = fact[0] = ifact[0] = fact[1] = ifact[1] = 1;
    for(int i = 2; i < M; i++) {
        fact[i] = fact[i-1] * i % mod;
        inv[i] = (mod - (mod/i) * inv[mod % i] % mod) % mod;
        ifact[i] = ifact[i-1] * inv[i] % mod;
    }
    
    
    int n, m; cin >> n >> m;
    ll ans = 0;
    for (int i = 0; i <= m; i++) {
        ll here = sqr(npr(m-i, n-i)) * ncr(m, i) % mod * npr(n, i) % mod;
        if (i & 1) ans = (ans - here + mod) % mod;
        else ans = (ans + here) % mod;
    }
    cout << ans << "\n";



    




    

    return 0;
}



Measured memory_bytes: 15316