#include <bits/stdc++.h>

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define forev(i, b, a) for(int i = (b); i >= (a); --i)
#define VAR(v, i) __typeof(i) v=(i)
#define forit(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define inf INT_MAX
#define int ll

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi; 
typedef vector<ll> Vll;
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;

const int maxn = (int) 1e7   + 100;
const int mod = (int) 1e15 + 37;
const double pi = acos(-1.0);

int t, ans[222], id;
ll f[222], sum[222];
vpii g[222];
vi ok[222];      
map<int, int> was;
int binmult(int a, int b){
  int res = 0;
  while(b){
    if(b & 1) res += a;
    b >>= 1;
    a = (a + a) % mod;
  }
  return res;
}              
main () {
  cin >> t;
  vi all;
  forn(i, 1, t){
    int l, r;
    cin >> l >> r;  
    if(!l){
      if(!was[r]) was[r] = ++id;
      if(!was[0]) was[0] = ++id;
      ok[was[r]].pb(i);       
      all.pb(r);
      continue;
    }
    if(!was[r]) was[r] = ++id;
    if(!was[l - 1]) was[l - 1] = ++id;
    g[was[r]].pb(mp(was[l - 1], i));
    all.pb(l - 1);
    all.pb(r);
  }
  if(!was[0]) was[0] = ++id;
  all.pb(0);
  for(auto x : ok[was[0]]) ans[x] = 1;
  sort(all(all));
  all.resize(unique(all(all)) - all.begin());
  f[was[0]] = 1, sum[was[0]] = 1;
  forn(ii, 1, sz(all) - 1){
    int i = all[ii], j = all[ii - 1], curf = f[was[j]], curs = sum[was[j]];
    forn(k, j + 1, i){
      curf = binmult(curf, k);
      curs = (curs + curf) % mod;
    }
    f[was[i]] = curf, sum[was[i]] = curs;
    for(auto x : g[was[i]]){
      ans[x.s] = (sum[was[i]] - sum[x.f] + mod) % mod;
    }
    for(auto x : ok[was[i]]){
      ans[x] = curs;
    }
  }
  forn(i, 1, t) cout << ans[i] << endl;
}