缺省源（没必要为了适应xcpc而用devc++）

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int mod = 1e9 + 7;
//快读
void read(int &x) {
    int res = 0, f = 1;
    char c = getchar();
    while (!isdigit(c)) {
        if (c == '-') f = -1;
        c = getchar();
    }
    while (isdigit(c)) res = (res << 1) + (res << 3) + (c - '0'), c = getchar();
    x = res * f;
}
//快输
void OUT(int x) {
    if (x < 0) x = -x, putchar('-');
    if (x > 9) OUT(x / 10);
    putchar(x % 10 + '0');
}
void print(int a, char c) { OUT(a), putchar(c); }
//逆元
int Inv(int x) { return (x == 1) ? x : (mod - mod / x) * Inv(mod % x) % mod; }
//组合数
struct Comb {
    /*后面还是要学会自己敲*/
    int re[N], inv[N], fac[N];
    void init(int n) {
        fac[0] = fac[1] = 1;
        inv[1] = 1;  //独独没有inv[0]
        re[0] = re[1] = 1;
        for (int i = 2; i <= n; i++) {
            fac[i] = fac[i - 1] * i % mod;
            inv[i] = (mod - mod / i) * inv[mod % i] % mod;
            re[i] = re[i - 1] * inv[i] % mod;
        }
    }
    int C(int a, int b) { return fac[a] * re[b] % mod * re[a - b] % mod; }
};

signed main() {}
/*

*/