import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
      Scanner sr=new Scanner(System.in);
      int t=sr.nextInt();
      int inpn[]=new int[t];
      int inpk[]=new int[t];
      int maxn=Integer.MIN_VALUE;
      int maxk=Integer.MIN_VALUE;
      
      for(int k=0;k<t;k++)
      {
        int a=sr.nextInt();
        int b=sr.nextInt();
        inpn[k]=a;
        inpk[k]=b;
        if(a>maxn)
        {
          maxn=a;  
        }
        if(b>maxk)
        {
          maxk=b;  
        }
      }

        DP[][] dp=new DP[maxn+1][maxk+1];
        for(int j=1;j<=maxk;j++)
        {
          for(int i=1;i<=maxn;i++)
          {
            if(j==1)
              dp[i][j]=new DP(i-1, 0);
            else
            {
              if(i<=j)
              {
                dp[i][j]=new DP(0,0);   
              }
              else
              { 
                dp[i][j]=new DP(dp[i-1][j].total, dp[i-1][j-1].startingWithZero);
              }
            }
          }
        }
        for(int i=0;i<inpn.length;i++)
        {
          System.out.println(dp[inpn[i]][inpk[i]].total);
        }
      
    }
}
class DP
{
  int startingWithZero;
  int startingWithOne;
  int total;
  
  public DP(int a, int b)
  {
    startingWithZero=a;
    startingWithOne=b;
    total=a+b;
  }
}