5251：斯特林数

#include <iostream>
#include <cstdio>
#define ll long long
using namespace std;
const int _MOD = 1000000007;
int n, m;
ll pow[1000010];
ll nipow[1000010];
inline ll Pow(ll a, ll b) {
    ll res = 1;
    while (b) {
        if (b&1) res = res*a%_MOD;
        a = a*a%_MOD;
        b>>=1;
    }
    return res;
}
inline ll _(int a) {
    return a&1?_MOD-1:1;
}
int main() {
    scanf("%d%d", &n, &m);
    pow[0] = 1;
    for (int i = 1; i <= m; i++) {
        pow[i] = pow[i-1]*i%_MOD;
    }
    nipow[m] = Pow(pow[m], _MOD-2);
    for (int i = m-1; i > -1; i--) {
        nipow[i] = nipow[i+1]*(i+1)%_MOD;
    }
    ll res = 0;
    for (int i = 0; i <= m; i++) {
        res+=_(m-i)*Pow(i, n)%_MOD*nipow[i]%_MOD*nipow[m-i]%_MOD;
        if (res>=_MOD) res-=_MOD;
    }
    printf("%lld", res);
    return 0;
}