#include<iostream>
using namespace std;
int n, g, ans=0;
void dfs(int pos, int m, int k){
	 if(k>n)return;
	 if(pos==g){
	 	if(k==n){
		 	ans++;
		}
		return;
	 }
	 for(int i=m;i<=n;i++){
	 	dfs(pos+1, i, k+i);
	 }
}
int main(){
	int t;
	cin>>t;
	while(t--){
		ans=0;
		cin>>n>>g;
		dfs(0, 0, 0);
		cout<<ans<<endl;
	}
}

https://www.luogu.com.cn/problem/P2386 0pts