hdu4602

#include<iostream>
const long long MOD = 1000000007ll;
using namespace std;
long long solve(int n,int k)
{
    long long a=n-k+3;
    long long b=2;
    long long c=n-k-2;
    if(n-k==0)return 1;
    if(n<k)return 0;
    if(c==-1)return a/2;
    while(c)
    {
        if(c%2)
            a=a*b%MOD;
            b=b*b%MOD;
            c/=2;
    }
    return a;
}
int  main()
{
    int T,n,k;
    cin>>T;
    while(T--)
    {
        cin>>n>>k;
        cout<<solve(n,k)<<endl;;
    }
    return 0;
}