#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
#define ff              first
#define ss              second
#define pb(x)           push_back(x)
#define mp              make_pair
#define sz(x)           (int)x.size()
#define mem(x ,y)       memset(x , y , sizeof x )
#define all(a )         a.begin() , a.end()
#define endl            "\n"
#define pii             pair<int,int> 
#define clr(x)          x.clear()
#define sl(x )          scanf("%I64d" ,&x)
#define si(x )          scanf("%d" ,&x)
#define forn(i ,x,n )   for(int i = x ; i <= n ; i++ )
#define ford(i ,x,n )   for(int i = x ; i >= n ; i-- )
#define rep(i,n )       for(int i= 0; i<n ; i++ )  
#define repit(i, c)     for( __typeof((c).begin()) i = (c).begin(); i != (c).end();++i )
    
#ifndef ONLINE_JUDGE           
    #define dbg(args...)    do {   cout << #args << ' ' ;  print(args); } while(0); cerr<< endl ;
#else 
    #define dbg(args...)   ; 
#endif 

typedef long long ll  ;
typedef unsigned long long ull  ;

ll  mod =  1e9+7, mod2 = 998244353 ; 
int setbit(int n, int pos  ) { return n = n|(1LL<< pos) ; }
int resetbit(int n,int pos ) {  return n =  n & ~(1LL<<pos ); }
bool checkbit(int  n,int pos ) { return (bool ) (n&(1LL<<pos))  ; }
template<typename T> void print(const T& v) {    cerr << v << ' ' ;}
template<typename T>T add(T x, T y, T mod = mod ){ x%= mod ;  y%= mod ;   return (x+y)%mod ;  }
template<typename T>T sub(T x, T y, T mod = mod ){ return ((x-y)%mod+mod )%mod;  }
template<typename T>T mul(T x, T y, T mod = mod ){ x %= mod ; y %= mod ; return (x*y)%mod  ;  }
template<typename T1,typename... T2> void print( const T1& first, const T2&... rest ){ print(first); print(rest...) ;}
template<typename T> void dbg_a(T a[] ,int n=10 ) {cerr << "[ "; for(int i=0;i <= n ; i++ )cerr<<a[i]<<' ' ; cerr<< " ]" <<  endl; } 
template<typename F,typename S>ostream& operator<<( ostream& os, const pair< F, S > & p ){return os << "[ " << p.first << ", " << p.second << " ]";}
template<typename T>ostream &operator<<(ostream & os, const vector< T > &v ){os << "[ "; for(int i=0; i<sz(v) ; i++ )  os << v[i] << ' ' ; return os << " ]\n" ; } 
template<typename T>ostream &operator<<(ostream & os, const map< T ,T> &Map ){os << "[ "; repit(it , Map ) os << "[" <<(*it).ff << ' ' << (*it).ss << "] "    ; return os << "]\n" ; } 
template<typename T>ostream &operator<<(ostream & os, const set< T > &Set  ){os << "[ "; repit(it , Set ) os <<  *it  << ' ' ; return os << " ]\n" ; }  
template<typename T>ostream &operator<<(ostream & os, const multiset< T > &Set) {os << "[ "; repit(it , Set )os <<  *it  << ' ' ; return os << " ]\n" ; }  
template<class T> string to_str(T t){stringstream ss; ss<<t; return ss.str();} 
// typedef tree<  int    ,     // change type 
//               null_type, 
//               less_equal  < int  >  ,  // change type ..    
//               rb_tree_tag,
//               tree_order_statistics_node_update> ordered_set;
template < typename T > 
T  bigmod(T x, T k ,T mod = mod) {
    if(k == 0 ) return (T)1; 
    if(k&1  ) { 
        return ( (x%mod)*bigmod(x,k-1, mod )%mod )%mod ; 
    } else { 
        T ret = bigmod(x,k/2  , mod ) ; 
        ret %= mod ;             
        return (ret*ret )%mod; 
    } 
}
template < typename T > 
T  invmod( T x , T m) {  
    return bigmod(x,m-2 , m) ;   

}  
#define  int  ll   
const int maxn  = (int)5e5+123 ;
const ll inf  =  1e18 ; //  0xc0  ; //0x3f ; // 
/////////////////////////////////////////////////////

int   fact[ maxn ]  ,inv[ maxn] ;
void  process() {    
    fact[0]=1LL;
    forn(i, 1 ,  maxn-1 ) fact[i] = mul(fact[i-1], i*1LL )   ;
    rep(i , maxn ) inv[i] =  invmod(fact[i] , mod )  ; 
   
}
int nCr (ll n ,ll r  ) {
    if( n-r < 0 or n<0 or r<0)  return   0 ; 
    ll nr =    inv[n-r]  ;  //   invmod(fact[n-r] ,mod ) ;       //inv[n-r ] ; 
    n = fact[n ] ; 
    r = inv[ r] ;                //inv[r ] ; 
    return mul(n, mul(r,nr) )   ; 
 
}
int nPr(int n ,int r) {
    if(n-r<0 or n<0  or r<0) return   0  ; 
    ll nr =    inv[n-r]  ;  //   invmod(fact[n-r] ,mod ) ;       //inv[n-r ] ; 
    n = fact[n ] ; 
    r = inv[ r] ;                //inv[r ] ; 
    return mul(n, nr )   ; 
    

}
void  solve() {   
    int  x,y,z,m,ans=0,n, f=1  , cnt = 0 ; 

    cin >>  n >> m  ;
      
    process() ;
 
    ans = 0 ; 
    rep( k,n+1 ) {

        // mCk *  nPk *  (m-k)P(n-k) ^ 2 
        x = nCr( m,k );   
        y = nPr( n,k ) ; 
        z = nPr( m-k, n-k ) ; 
        z = mul( z,z);

        x =  mul(x , mul(y,z ) ); 
        if(k&1)  ans = sub(ans , x) ; 
        else ans =  add(ans,x ) ; 

    }

    cout <<  ans << endl ;

}               
signed main() {               
   
    ios :: sync_with_stdio(false);  cin.tie(0); 
    cout.tie(0) ;      
        // clock_t st = clock()  ; cout << fixed << setprecision(12) ; 
    int  c = 0 ,t = 1  ;     
    // cin  >>t ; 
    while(t--) {
        solve() ;  
    }
    //cerr<<"Execution time : " << (double)(clock()-st )/CLOCKS_PER_SEC << endl ; 

    return 0 ;    
}     




Measured memory_bytes: 11428