组合数 + 快速幂 + 逆元打表 + 阶乘打表

/**
 *  Fuck you.
 *  I love you too.
 */

#include<bits/stdc++.h>
#define lson i<<2
#define rson i<<2|1
#define LS l,mid,lson
#define RS mid+1,r,rson
#define mem(a,x) memset(a,x,sizeof(a))
#define gcd(a,b) __gcd(a,b)
#define ll long long
#define ull unsigned long long
#define lowbit(x) (x&-x)
#define enld endl
#define mian main
#define itn int
#define prinft printf

const int INF = 0x3f3f3f3f;
const int EXP = 1e-8;
const int N = 1e5 + 5;
const int M = 1e9 + 7;
const int MAXN = 1e5 + 5;

using namespace std;

// n不太大 1e5
ll fac[N] = {1, 1}, inv[N] = {1, 1}, f[N] = {1, 1};

ll c (ll a, ll b) {
    if (b > a)
        return 0;
    return fac[a] * inv[b] % M * inv[a - b] % M;
}

void init() {
    for (int i = 2; i < N; i++) {
        fac[i] = fac[i - 1] * i % M;
        f[i] = (M - M / i) * f[M % i] % M;
        inv[i] = inv[i - 1] * f[i] % M;
    }
}

// n较大 1e9
ll qpow (ll a, ll b) {
    ll ans = 1;
    while (b) {
        if (b & 1)
            ans = ans * a % M;
        a = a * a % M;
        b >>= 1;
    }
    return ans;
}

ll C (ll n, ll m) {
    if (m > n)
        return 0;
    ll ans = 1;
    for (int i = 1; i <= m; i++)
        ans = ans * (n - i + 1) % M * qpow (i, M - 2) % M;
    return ans;
}

int main() {
    init();
    cout << c (4, 2) << endl;
    cout << C (4, 2) << endl;
    return 0;
}