#include<iostream>
#include<algorithm>
using namespace std;

long long g(int n, int m){
    if(n < m) return 0;
    else if(m == 0 || n == m)    return 1;
    else{
        m = max(m, n-m);
        long long ans = 1;
        for(int i=1; i<=m; i++)    ans = ans*(n-i+1)/i; 
        return ans;
    }
}

int main(){
    int T;
    cin >> T;
    while(T--){
        int m, n;
        cin >> m >> n;
        cout << g(m, n) << endl;
    }
    
    return 0;
}