#include<queue>

#include<math.h>

#include<stdio.h>

#include<string.h>

#include<string>

#include<iostream>

#include<algorithm>

using namespace std;

#define N 2005

#define INF 0x3f3f3f3f

long long f[N],n,m;

int Cmn(int m, int n)

{

    if(m < n || n < ) return ;

    if(m == n || n == ) return ;

    return (Cmn(m-, n-) + Cmn(m-, n));

}

int main()

{

    f[]=;f[]=;

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

        f[i]=(i-)*(f[i-]+f[i-]);

    int T;cin>>T;

    while(T--)

    {

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

        cout<<Cmn(n,m)*f[m]<<endl;

    }

    return ;

}

/*

*/

//freopen("1.txt", "r", stdin);

    //freopen("2.txt", "w", stdout);