#include <iostream>

 #include <cstring>

 #include <cstdio>

 #include <vector>

 #include <cmath>

 #include <algorithm>

 using namespace std;

 #define N 100005//一开始是10005,超时

 #define mod 1000000007

 #define gep(i,a,b) for(int i=a;i<=b;i++)

 #define mem(a,b) memset(a,b,sizeof(a))

 #define ll  long long

 ll fac[N]={,},inv[N]={,},f[N]={,};

 ll c(ll a,ll b)

 {

    if(b>a)  return ;

    return fac[a]*inv[b]%mod*inv[a-b]%mod;

 }

 void init()

 {

     gep(i,,N-){

         fac[i]=fac[i-]*i%mod;

         f[i]=(mod-mod/i)*f[mod%i]%mod;

         inv[i]=inv[i-]*f[i]%mod;

     }

 }

 struct Ma{

     ll n,m;

     int id;

     bool operator <(const Ma&a)const{

         return n<a.n;//排序

     }

 }ma[N];

 vector<Ma>ve[N];

 ll ans[N];

 int t;

 int main()

 {

   init();

   scanf("%d",&t);

   ll mx=sqrt();

   gep(i,,t){

      scanf("%lld%lld",&ma[i].n,&ma[i].m);

      ll x=ma[i].m/mx;

       ma[i].id=i;

      ve[x].push_back(ma[i]);//分块

   }

   gep(i,,mx){

       if(!ve[i].size())  continue;

       sort(ve[i].begin(),ve[i].end());//排序

       int k=ve[i].size();

       ll val=,ik=-,mn=ve[i][].n;//一次处理每组数据

       /*

       s(n,m):c(n,0)+c(n,1)+……c(n,m)

       s(n,m)=2*s(n-1,m)-c(n-1,m)

       */

       gep(j,,k-){

           while(mn<ve[i][j].n) val=(2ll*val+mod-c(mn++,ik))%mod;//+mod

           while(ik<ve[i][j].m) val=(val+c(mn,++ik))%mod;//,++ik,不是ik++,可以不加mod

           while(ik>ve[i][j].m) val=(val+mod-c(mn,ik--))%mod;//+mod

           ans[ve[i][j].id]=val;

       }

   }

   gep(i,,t){

        printf("%lld\n",ans[i]);

       }

   return ;

 }