#include<cstdio>

#include<algorithm>

using namespace std;

const int maxn=;

const int md=;

int D[maxn];

int C[maxn][];

int F[maxn];

int main()

{

    D[]=;

    D[]=;

    D[]=;

    for (int i=;i<=;i++)

    {

        D[i]=1ll*(i-)*(0ll+D[i-]+D[i-])%md;

    }

    C[][]=;

    for (int i=;i<=;i++)

    {

        C[i][]=;

        for (int j=;j<=min(,i);j++)

        {

            C[i][j]=(C[i-][j-]+C[i-][j])%md;

        }

    }

    F[]=;

    for (int i=;i<=;i++)

    {

        F[i]=1ll*F[i-]*i%md;

    }

    int t;

    scanf("%d",&t);

    while (t--)

    {

        int n,k;

        scanf("%d%d",&n,&k);

        int ans=F[n];

        for (int i=;i<k;i++)

        {

            ans=(ans-1ll*C[n][i]*D[n-i]%md+md)%md;

        }

        printf("%d\n",ans);

    }

    return ;

}