#include <bits/stdc++.h>

using namespace std;

const int mod = 1e9+;

const int N = 1e5+;

int t;

int blk;

int blg[N];

int fac[N], inv[N], tmp[N];

int l, r, now;

int ans[N];

struct ask {

    int l, r, id;

    bool operator < (const ask &a) {

        return blg[l] == blg[a.l] ? r < a.r : l < a.l;

    }

}q[N];

int C(int n, int m) {

    int res = 1ll*fac[n]*inv[m]%mod;

    res = 1ll*res*inv[n-m]%mod;

    return res;

}

void update(int k, int t) {

    if(t == ) {

        if(~k) now = (2ll*now-C(l, r)+mod)%mod;

        else now = 1ll*(now+C(l-, r))*tmp[]%mod;

    }

    else {

        if(~k) now = (now+C(l, r))%mod;

        else now = (now-C(l, r)+mod)%mod;

    }

}

int main() {

    fac[] = fac[] = tmp[] = inv[] = inv[] = ;

    for(int i = ; i < N; i++) {

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

        tmp[i] = 1ll*(mod-mod/i)*tmp[mod%i]%mod;

        inv[i] = 1ll*inv[i-]*tmp[i]%mod;

    }

    scanf("%d", &t);

    int up = ;

    for(int i = ; i <= t; i++) {

        scanf("%d%d", &q[i].l, &q[i].r);

        up = max(up, q[i].r);

        q[i].id = i;

    }

    blk = sqrt(t);

    for(int i = ; i <= up; i++) blg[i] = (i-)/blk;

    sort(q+, q+t+);

    now = ;

    l = , r = ;

    for(int i = ; i <= t; i++) {

        while(r > q[i].r) update(-, ), r--;

        while(l < q[i].l) update(, ), l++;

        while(l > q[i].l) update(-, ), l--;

        while(r < q[i].r) r++, update(, );

        ans[q[i].id] = now;

    }

    for(int i = ; i <= t; i++) printf("%d\n", ans[i]);

}