using System; using System.Collections; using System.Collections.Generic; using System.Collections.Specialized; using System.Text; using System.Text.RegularExpressions; using System.Linq; using System.IO; class Program { static Magatro M = new Magatro(); static void Main() { M.Scan(); M.Solve(); } } class Magatro { private long N, M; private const int Mod = 1000000007; private long[] Factorial; public void Scan() { Scanner sc = new Scanner(); N = sc.NextLong(); M = sc.NextLong(); } public void Solve() { if (N < M) { Console.WriteLine(0); return; } FactorialCalc(); long ans = 0; for(int i = 0; i < M; i++) { int plus; if (i % 2 == 0) { plus = 1; } else { plus = -1; } ans += Converter(plus * MCombination(i) * MyPow(M - i,N,Mod)); } Console.WriteLine(ans%Mod); } private long Converter(long n) { while (n < 0) n += Mod; return n; } private long MCombination(long n) { long bunshi = Factorial[M]; long bunbo = (Factorial[n] * Factorial[M - n]) % Mod; return (bunshi * MyPow(bunbo, Mod - 2, Mod)) % Mod; } private void FactorialCalc() { Factorial = new long[M + 1]; Factorial[0] = 1; for(int i = 1; i <= M; i++) { Factorial[i] = (Factorial[i - 1] * i) % Mod; } } private long MyPow(long a,long b,long mod) { long result = 1; while (b > 0) { if (b % 2 == 0) { a = (a * a) % mod; b /= 2; } else { result = (result * a) % mod; b--; } } return result; } } public class Scanner { private string[] S; private int Index; private char Separator; public Scanner(char separator=' ') { Index = 0; Separator = separator; } private string[] Line() { return Console.ReadLine().Split(Separator); } public string Next() { string result; if (S == null || Index >= S.Length) { S = Line(); Index = 0; } result = S[Index]; Index++; return result; } public int NextInt() { return int.Parse(Next()); } public double NextDouble() { return double.Parse(Next()); } public long NextLong() { return long.Parse(Next()); } }