#include<bits/stdc++.h> using namespace std; #define N 100001 #define mod 1000000007 int pw[N],inv[N],T; int qpow(int x,int y){ int z=1; while(y){ if(y&1)z=1ll*z*x%mod; x=1ll*x*x%mod;y>>=1; } return z; } int main(){ scanf("%d",&T); pw[0]=1; for(int i=1;i<N;++i)pw[i]=(1ll*pw[i-1]*i)%mod; inv[N-1]=qpow(pw[N-1],mod-2); for(int i=N-2;i>=1;--i)inv[i]=(1ll*inv[i+1]*(i+1))%mod; inv[0]=1; while(T--){ int n,k;scanf("%d%d",&n,&k); int ans=0; for(int i=0;i<=k;++i)ans=(ans+(1ll*pw[n]*inv[i]%mod*inv[n-i]%mod))%mod; printf("%d\n",ans); } return 0; }