#include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <memory>
#include <complex>
#include <numeric>
#include <cstdio>
#include <iomanip>
#include <random>

#define REP(i,m,n) for(int i=int(m);i<int(n);i++)
#define RREP(i,m,n) for(int i=int(n)-1;i>=int(m);--i)
#define EACH(i,c) for (auto &(i): c)
#define all(c) begin(c),end(c)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort(begin(c),end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
//#define int long long

#ifdef LOCAL
#define DEBUG(s) cout << (s) << endl
#define dump(x)  cerr << #x << " = " << (x) << endl
#define BR cout << endl;
#else
#define DEBUG(s) do{}while(0)
#define dump(x) do{}while(0)
#define BR 
#endif
using namespace std;

using UI = unsigned int;
using UL = unsigned long;
using LL = long long;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
using VS = vector<string>;
using PII = pair<int,int>;
using VP = vector<PII>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

constexpr int MOD = 1'000'000'007;

template<class T> inline T sqr(T x) {return x*x;}

long long power(long long x, long long n, long long mod = 1000000007) {
    if (n == 0) return 1;
    if (n % 2 == 0) return power(x * x % mod, n/2, mod);
    else return x * power(x, n-1, mod) % mod;
}

class CNK {
    vector<long long> prod, inv;
public:
    CNK(int n): prod(n+1), inv(n+1) {
        prod[0] = 1;
        for (int i = 1; i <= n; ++i) prod[i] = (prod[i-1] * i) % MOD;
        inv[n] = power(prod[n], MOD-2);
        for (int i = n - 1; i >= 0; --i) inv[i] = (inv[i+1] * (i+1)) % MOD;
    }
    int get(const int &n, const int &k) const {
        if (n < k) return 0;
        if (n < 0 || k < 0) return 0;
        return (prod[n] * ((inv[k] * inv[n-k]) % MOD)) % MOD;
    }
};



// auto mod int
struct mint {
    LL x;
    mint(LL x=0):x((x%MOD+MOD)%MOD){}
    mint operator-() const { return mint(-x);}
    mint& operator+=(const mint a) {
        if ((x += a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator-=(const mint a) {
        if ((x += MOD-a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator*=(const mint a) {
        (x *= a.x) %= MOD;
        return *this;
    }
    mint operator+(const mint a) const {
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint a) const {
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint a) const {
        mint res(*this);
        return res*=a;
    }
    mint pow(const LL &t) const {
        if (!t) return 1;
        mint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }

    // for prime MOD
    mint inv() const {
        return pow(MOD-2);
    }
    mint& operator/=(const mint a) {
        return (*this) *= a.inv();
    }
    mint operator/(const mint a) const {
        mint res(*this);
        return res/=a;
    }
    LL operator()() const {
        return x;
    }
};
using VM = vector<mint>;
using VVM = vector<VM>;


void solve() {
    LL n,m;
    cin >> n >> m;
    CNK cnk(m);
    VM kai(m+1);
    kai[0] = 1;
    kai[1] = 1;
    REP(i,2,m+1) kai[i] = kai[i-1] * i;
    // mint ans = kai[n] * cnk.get(m,n);
    mint ans = kai[m] / kai[m-n];
    // dump(ans());
    REP(i,1,n+1) {
        int pl = (i % 2 ? -1 : 1);
        // ans += (kai[m-i] * cnk.get(n,i)) * pl;
        // ans += (kai[m] / kai[m-n] / (kai[m] / kai[m-i]) * cnk.get(n,i)) * pl;
        ans += (kai[m-i] / kai[m-n] * cnk.get(n,i)) * pl;
        // dump(ans());
    }
    ans *= kai[n] * cnk.get(m,n);
    cout << ans() << endl;
}

signed main() {
    solve();
    
    return 0;
}

Measured memory_bytes: 14788