#include <iostream>
#define DEGENERATE 2
#define ZERO 0
using namespace std;

const int N = 10000 + 10;
const int parameter = 100000 + 10;

int queryNumber;

void declaration(){
    scanf("%d", &queryNumber);
}

long long factorial[parameter];
long long inverseFactorial[parameter];

const int mod = 1e9 + 7;

//错误2：为什么直接对形式参数modelForExponent操作就出现异常错误，而用int型暂存形式参数就没有问题？？
//因为modelForExponent同时作为取模的数导致了错误，取模应该是对mod变量而非modelForExponent
long long quickPowerToInverse(int numberToTransform, int modelForExponent){
    if (modelForExponent == DEGENERATE) return 1;
    else if (modelForExponent > DEGENERATE){
        long long multiplyAccumulation = 1;
        long long multiplyFactor = numberToTransform;
        //int exponent = modelForExponent - 2;
        modelForExponent = modelForExponent - 2;
        while (modelForExponent != ZERO){
            if ((modelForExponent & 1) != ZERO){  //错误1：难道这里不是位运算优先于关系运算吗？建议用括号，如杜祥军所言。
                multiplyAccumulation = (long long)multiplyAccumulation * multiplyFactor % mod;
            }
            modelForExponent >>= 1;
            multiplyFactor = (long long)multiplyFactor * multiplyFactor % mod;
        }
        //printf("得到逆元结果%lld。\n", multiplyAccumulation);
        return multiplyAccumulation;
    }
}

void createMemorandum(){
    factorial[0] = inverseFactorial[0] = 1;
    for (int rank = 1; rank <= parameter; rank ++){
        factorial[rank] = factorial[rank - 1] * rank % mod;
        inverseFactorial[rank] = inverseFactorial[rank - 1] * quickPowerToInverse(rank, mod) % mod;
    }
}

void queries(){
    while (queryNumber --){
        int upNumber, downNumber;
        scanf("%d%d", &downNumber, &upNumber);
        long long combinationNumber = factorial[downNumber] * inverseFactorial[upNumber] % mod * inverseFactorial[downNumber - upNumber] % mod;
        printf("%lld\n", combinationNumber);
    }
}

int main(){
    declaration();
    createMemorandum();
    queries();
    return 0;
}