Baekjoon #1010

#include<bits/stdc++.h>

using namespace std;
typedef long long ll;

ll DP[33][33];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int T; cin >> T;
    DP[0][0] = 1;
    for(int i=1;i<=30;i++) {
        DP[i][0] = 1;
        for(int j=1;j<=30;j++) {
            DP[i][j] = DP[i - 1][j] + DP[i - 1][j - 1];
        }
    }
    while(T--) {
        int N, M; cin >> N >> M;
        cout << DP[M][N] << '\n';
    }

    return 0;
}

import java.util.*;
import java.io.*;

public class Main {
    static int[][] dp = new int[30][30]; 

    public static void main(String[] args) {
        FastReader rd = new FastReader();

        int T = rd.nextInt();

        // 조합공식을 이용하여 풀이가능 (M C N)
        dp[0][0] = 1;
        for(int j = 1;j < 30;j++) {
            dp[j][0] = 1;
            for(int k = 1;k <= j;k++) 
                dp[j][k] = dp[j - 1][k - 1] + dp[j - 1][k];
        }

        for(int i = 0;i < T;i++) {
            int N = rd.nextInt();
            int M = rd.nextInt();

            System.out.println(dp[M][N]);
        }
    }

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while(st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() { return Integer.parseInt(next()); }
        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            }
            catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}

import sys
def input():
    return sys.stdin.readline().rstrip()

T = int(input())

dp = [[0 for _ in range(31)] for _ in range(31)]
dp[0][0] = 1

for num in range(1,31):
    dp[num][0] = 1
    for pick in range(1,31):        
        dp[num][pick] = dp[num-1][pick] + dp[num-1][pick-1]

for _ in range(T):
    N, M = map(int,input().split())
    print(dp[M][N])