#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef unsigned long long int lu;
typedef vector< int > vi;
typedef vector < ll > vl;
typedef set <ll> sl;
typedef vector< vi > vvi;
typedef vector< vl > vvl;
typedef pair< int,int > ii;
typedef pair< ll,ll > il;
#define sz(a) ll((a).size())
#define test(t) ll t;cin>>t;while(t--)
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define tr(c,i) for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define present(c,x) ((c).find(x) != (c).end())
#define cpresent(c,x) (find(all(c),x) != (c).end())
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define Vi vector
#define pr pair
#define mpr make_pair
#define fi first
#define se second
#define isnum(a) (a>=48 && a<=57)
#define isS(a) (a>='a' && a<='z')
#define isU(a) (a>='A' && a<='Z')
#define toS(a) (isU(a)?a+32:a)
#define toU(a) (isS(a)?a-32:a)
#define toC(a) a&15
 
vector <ll> sprime;
ll d[100005];
 
vector<char> prime (1000000+5, true);
void sieve(ll n)
{   
    //O(nloglogn) time
    prime[0] = prime[1] = false;
    for (ll i=2; i<=n; ++i)
    {
        if (prime[i])
        {
            sprime.pb(i);           
            for (ll j=2*i; j<=n; j+=i)
            {
                prime[j] = false;
            }
        }
    }
}
#define forn(i,e) for(int i = 0; i < e; i++)
#define rep(i,a,b) for(i=a;i<b;i++)
#define REP(i,a,b) for(i=a;i<=b;i++)
#define reprev(i,a,b) for(i=a;i>=b;i--)
 
// Convex Hull Trick
typedef ll LT;
typedef pair<LT,LT> LP;
struct CHT {
  deque<LP> d;
  LT get(LT x) {
    while (sz(d) >= 2) {
      LT a = d[0].fi*x + d[0].se;
      LT b = d[1].fi*x + d[1].se;
      if (a <= b) break; // get min
      d.pop_front();
    }
    return d[0].fi*x + d[0].se;
  }
  void add(LP x) { // decreasing order of x.fi
    while (sz(d) >= 2) {
      LP y = d[sz(d) - 1];
      LP z = d[sz(d) - 2];
      if ((x.se-y.se)*(z.fi-y.fi) >= (y.fi-x.fi)*(y.se-z.se)) break; // both
      d.pop_back();
    }
    d.pb(x);
  }
};
//
 
#define leadzero(a) __builtin_clz(a) //count leading zeros
#define trailzero(a) __builtin_ctz(a) //count trailing zeros
#define bitcount(a) __builtin_popcount(a) // count set bits (add ll)
#define ln cout<<endl
#define sp cout<<" "
#define maxe(a) *max_element(a.begin(),a.end())
#define maxi(a) max_element(a.begin(),a.end())-a.begin()
#define mine(a) *min_element(a.begin(),a.end())
#define mini(a) min_element(a.begin(),a.end())-a.begin()
ll gcd(ll a, ll b) { if(b == 0) return a; return gcd(b, a % b); }
ll fastpowMOD(ll a, ll p,ll MOD){ if(p==0) return 1; ll z = fastpowMOD(a,p/2,MOD); z = (z*z)%MOD; if(p%2) z = (z*a)%MOD; return z; }
ll fastpow(ll a, ll p){ if(p==0) return 1; ll z = fastpow(a,p/2); z = (z*z); if(p%2) z = (z*a); return z; }
//CHT stands for convex hull trick
ll search1(ll a[], ll f,ll n)
{
    ll left=1;
    ll right=n+1;
    while(right-left>1)
    {
        ll mid = left + (right-left)/2;
        if(a[mid]<f)
        {
            left=mid;
        }
        else right=mid;
    }
    return a[left];
}
 
const ll INF = 1e18;
vector<ll> lazy;
vector<ll> tree;
 
void updateRange(ll node, ll start, ll end, ll l, ll r, ll val)
{
    if(lazy[node] != 0)
    { 
        // This node needs to be updated
        tree[node] += (/*end - start*/ + 1) * lazy[node];    // Update it
        if(start != end)
        {
            lazy[node*2] += lazy[node];                  // Mark child as lazy
            lazy[node*2+1] += lazy[node];                // Mark child as lazy
        }
        lazy[node] = 0;                                  // Reset it
    }
    if(start > end or start > r or end < l)              // Current segment is not within range [l, r]
        return;
    if(start >= l and end <= r)
    {
        // Segment is fully within range
        lazy[node] += (/*end - start*/ + 1) * val;
        if(start != end)
        {
            // Not leaf node
            lazy[node*2] += lazy[node];
            lazy[node*2+1] += lazy[node];
        }
        tree[node]+=lazy[node];
        lazy[node]=0;
        return;
    }
    ll mid = (start + end) / 2;
    updateRange(node*2, start, mid, l, r, val);        // Updating left child
    updateRange(node*2 + 1, mid + 1, end, l, r, val);   // Updating right child
    tree[node] = max(tree[node*2],tree[node*2+1]);        // Updating root with max value 
}
 
ll queryRange(ll node, ll start, ll end, ll l, ll r)
{
    if(lazy[node] != 0)
    {
        // This node needs to be updated
        tree[node] += (/*end - start +*/ 1) * lazy[node];            // Update it
        if(start != end)
        {
            lazy[node*2] += lazy[node];         // Mark child as lazy
            lazy[node*2+1] += lazy[node];    // Mark child as lazy
        }
        lazy[node] = 0;                 // Reset it
    }
 
    if(start > end or start > r or end < l)
        return -INF;         // Out of range
 
    if(start >= l and end <= r)             // Current segment is totally within range [l, r]
        return tree[node];
    ll mid = (start + end) / 2;
    if(r<=mid)return queryRange(node*2, start, mid, l, r);
    else if(l>=mid+1) return queryRange(node*2 + 1, mid + 1, end, l, r);
    ll p1 = queryRange(node*2, start, mid, l, r);         // Query left child
    ll p2 = queryRange(node*2 + 1, mid + 1, end, l, r); // Query right child
    //tree[node] = max(tree[node*2],tree[node*2+1]);
    return max(p1,p2);
}
void convert_reduce(ll arr[], ll n) 
{ 
    vector <pair<ll, ll> > v; 
    for (ll i = 0; i < n; i++)v.push_back(make_pair(arr[i], i)); 
    sort(v.begin(), v.end());
    ll cnt = 0; 
    for (ll i=0; i<n; i++)
    {
        arr[v[i].second] = cnt;
        ll j = i;
        while(j<n && v[j].fi==v[i].fi)arr[v[j++].second] = cnt;
        i=j-1;
        cnt++;
    } 
} 

//for bfs 
ll dir[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};

bool valid(ll i, ll j,ll n,ll m) { return i >= 1 && i <= n && j >= 1 && j <= m; }

/*

E. NEQ  https://atcoder.jp/contests/abc172/tasks/abc172_e

(Editorial: ynymxiaolongbao) https://img.atcoder.jp/abc172/editorial.pdf

We first ignore the conditions that Ai ̸= Bi for any i such that 1 ≤ i ≤ N. In other words,
we consider all the pairs A and B of sequences of length N consisting of integers between 1 and
M (inclusive; the same applies hereinafter) such that, for all (i, j) such that 1 ≤ i < j ≤ N,
Ai ̸= Aj and Bi ̸= Bj .

For a set of integers whose each element is between between 1 and N, the number of pairs A
and B of sequences such that “for all i ∈ S, Ai = Bi” is 
mP|s|×((m−|s|)P(n−|s|))^2.

This expression can be obtained by considering the |S|-permutation of integers between 1 and M assigned to
Ai(= Bi) for each i such that i ∈ S, N − |S|-permutation of the remaining M − |S| integers
assigned to Ai for each i such that i /∈ S, and similarly N − |S| permutation of the M − |S|
integers assigned Bi for each i such that i /∈ S.

By inclusion-exclusion principle, the answer is the sum of the number of pairs of sets A and B
such that “for all i ∈ S, Ai = Bi”, multiplied by (−1)^|S|, for all sets 
of integers between 1 and N. In other words, the answer is the 
sum of (−1)^|S| × mP|s| × ((m−|s|)P(n−|s|))^2.

Here, calculating (−1)^|S| × mP|s| × ((m−|s|)P(n−|s|))^2
for all 2^N possibilities of S, but since this
value only depends on |S|, you can also calculate the sum by finding the value for |S| multiplied
by the number of S such that |S| is that value, that is, multiplied by nC|s|. 

Therefore, the answer is can be represented as 
N∑(K=0)(nCk × (−1)^K × mPk × ((m−k)P(n−k))^2).
Combinations and permutations can be calculated by making use of the 
little theorem of Fermat or extended Euclidean algorithm. By using 
the former, the total time complexity is O(M + N).

*/

ll MOD = (ll)1e9+7;

ll fact[(ll)5e5+7];

ll inverse[(ll)5e5+7];
int main(){
    fastio;
    ll n,m,i,j,k;
    cin>>n>>m;
    fact[0]=1;
    REP(i,1,(ll)5e5+1)fact[i]=(fact[i-1]*i)%MOD;
    REP(i,0,(ll)5e5+1)
    {
        inverse[i]=fastpowMOD(fact[i],MOD-2,MOD);
    }
    ll ans = 0;
    REP(k,0,n)
    {
        ll now = fact[n];
        now*=inverse[n-k];
        now%=MOD;
        now*=inverse[k];
        now%=MOD;
        now*=fact[m];
        now%=MOD;
        now*=fact[m-k];
        now%=MOD;
        now*=fastpowMOD(inverse[m-n],2ll,MOD);
        now%=MOD;
        if(k%2)
        {
            ans-=now;
            ans%=MOD;
            if(ans<0)ans+=MOD;
        }
        else 
        {
            ans+=now;
            ans%=MOD;
        }
    }
    cout<<ans<<endl;
    return 0;
}

Measured memory_bytes: 11916