/**************************************************
filename :d.cpp
author :maksyuki
created time :2017/3/3 16:59:59
last modified :2017/3/3 17:06:16
file location :C:\Users\abcd\Desktop\TheEternalPoet
***************************************************/
#pragma comment(linker, "/STACK:102400000,102400000")
#include <set>
#include <bitset>
#include <list>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <string>
#include <vector>
#include <ios>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <utility>
#include <complex>
#include <numeric>
#include <functional>
#include <cmath>
#include <ctime>
#include <climits>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cassert>
using namespace std;
#define CFF freopen ("in", "r", stdin)
#define CPPFF ifstream cin ("in")
#define DB(ccc) cout << #ccc << " = " << ccc << endl
#define PB push_back
#define MP(A, B) make_pair(A, B)
typedef long long LL;
typedef unsigned long long ULL;
typedef double DB;
typedef pair <int, int> PII;
typedef pair <int, bool> PIB;
const int INF = 0x7F7F7F7F;
const int MOD = 1e9 + 7;
const double EPS = 1e-10;
const double PI = 2 * acos (0.0);
const int maxn = 1e5 + 6666;
int dp[20][20];
int main()
{
//CFF;
//CPPFF;
dp[0][0] = 1;
for(int i = 1; i <= 12; i++)
for(int j = 0; j <= 12; j++)
if(j - i >= 0)
dp[i][j] = dp[i][j-i] + dp[i-1][j];
else
dp[i][j] = dp[i-1][j];
int t;
scanf("%d", &t);
while(t--)
{
int N, M;
scanf("%d%d", &M, &N);
printf("%d\n", dp[N][M]);
}
return 0;
}