#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>
#include <limits>
using namespace std;
#ifdef mycom
ifstream fin("input");
#else
#define fin cin
#endif
vector<int> v;
vector<int> orders;
int N, P, R;
unsigned long long counter=0;
void back(int order)
{
if(v.size() == orders.size())
{
vector<int> arr;
for(int i=0; i<orders.size(); i++)
{
arr.push_back(v[orders[i]]);
}
int myp, myr;
myp = myr = 0;
for(int i=0; i<arr.size(); i++)
{
bool allsmall = true;
for(int j=0; j<=i; j++)
{
if(arr[j] > arr[i])
{
allsmall = false;
break;
}
}
if(allsmall) // arr[i] 가 leftable 하다
{
myp++;
}
}
if(myp != P)
return;
for(int i=arr.size()-1; i>=0; i--)
{
bool allsmall = true;
for(int j=arr.size()-1; j>i; j--)
{
if(arr[j] > arr[i])
{
allsmall = false;
break;
}
}
if(allsmall) // arr[i] 가 rightable 하다
{
myr++;
}
}
if(myr != R)
return;
counter++;
}
else
{
for(int i=0; i<v.size(); i++)
{
if( find(orders.begin(), orders.end(), i) == orders.end() )
{
vector<int> arr;
for(int i=0; i<orders.size(); i++)
{
arr.push_back(v[orders[i]]);
}
int myp, myr;
myp = myr = 0;
for(int i=0; i<arr.size(); i++)
{
bool allsmall = true;
for(int j=0; j<=i; j++)
{
if(arr[j] > arr[i])
{
allsmall = false;
break;
}
}
if(allsmall) // arr[i] 가 leftable 하다
{
myp++;
}
}
if(myp > P)
return;
orders.push_back(i);
back(i);
orders.pop_back();
}
}
}
}
int main()
{
int mycase;
fin >> mycase;
while(fin >> N >> P >> R)
{
v.clear();
for(int i=1; i<=N; i++)
{
v.push_back(i);
}
counter = 0;
back(0);
cout << counter << endl;
}
return 0;
}