B-FlippedCards2

#include <fstream>
#define mod 100000469
#define LL long long
using namespace std;
long long fact[1000002],invers[1000002],inversfactorial[1000002];

LL solve(int x,int y)
{
    return (((fact[x-1]*y)%mod)*inversfactorial[x-y])%mod;
}

int main()
{
    fact[0]=fact[1]=1;
    invers[0]=invers[1]=1;
    inversfactorial[0]=inversfactorial[1]=1;
    for(LL i=2;i<=1000001;++i)
    {
        fact[i]=(i*fact[i-1])%mod;
        invers[i]=(invers[mod%i]*(mod-(mod/i)))%mod;
        inversfactorial[i]=(invers[i]*inversfactorial[i-1])%mod;
    }
    ifstream fin("flipc2.in");
    int n;
    fin>>n;
    /// (x-1)!y/(x-y)!
    ofstream fout("flipc2.out");
    for(int i=1;i<=n;++i)
    {
        int y,x;
        fin>>x>>y;
        fout<<solve(x,y)<<'\n';
    }
}