#include <iostream> using namespace std; int fang(int m,int n){ if(m == 1 || n == 0) return 1; if(n < m) return fang(m,m); return fang(m-1,n)+fang(m-1,n-m); } int main(){ int n,k,l; cin >> n; while(n--){ cin >> k >> l; cout << fang(l,k) << endl; } return 0; }