HDU6397（容斥）

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
#define maxn 200005
typedef long long ll;

ll mod = 998244353;
ll f[maxn], fv[maxn]; //f阶乘，fv乘法逆元
ll qpow(ll a, ll b)
{
    ll ans = 1;
    for(; b; b>>=1)
    {
        if(b&1) ans = ans*a%mod;
        a = a*a%mod;
    }
    return ans;
}

void init()
{
    f[0] = 1;
    for(ll i = 1; i <= maxn; i++)
        f[i] = (f[i-1]*i)%mod;
    fv[maxn-1] = qpow(f[maxn-1], mod-2);
    for(ll i = maxn-1; i > 0; i--)
    {
        fv[i-1] = fv[i]*i%mod;
    }
}

ll C(ll n, ll m)
{
    if(n<0||m<0||n<m) return 0;
    return f[n]*(fv[m])%mod*fv[n-m]%mod;
}

int main()
{
    ll n, m, k, ans;
    int T;
    init();
    scanf("%d", &T);
    while(T--)
    {
        scanf("%lld%lld%lld", &n, &m, &k);
        ll ans = 0;
        for(int c = 0; c*n <= k; c++)
        {
            if(c&1) ans = (ans-C(m,c)*C(k-c*n-1+m,m-1)%mod+mod)%mod;
            else ans = (ans+C(m,c)*C(k-c*n-1+m,m-1)%mod)%mod;
        }
        printf("%lld\n", ans);
    }
    return 0;
}