#include <bits/stdc++.h>
#include<cassert>
#include<cstring>
using namespace std;
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (ll)x.size()
#define Ouput2DVector(mat,n,m){for(int i=0;i<n;i++){for(int j=0;j<m;j++){cout<<mat[i][j]<< ' ';}cout<< endl;}}
using ll = long long int; using ld = long double; using ull = unsigned long long int;

void __print(int x) {cerr << x;} void __print(long x) {cerr << x;} 
void __print(long long x) {cerr << x;} void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;} void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;} void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;} void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';} void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""),__print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
template<typename T> istream& operator>>(istream& is,  vector<T>& v){for (auto& i : v) is >> i;return is;}
template<typename T> ostream& operator<<(ostream& os,  vector<T>& v){for (auto& i : v) os << i << ' ';return os;}

const ll inf = 1e18, maxn = 1e6 + 1, mod = 1e9 + 7;

ll add(ll a, ll b) {a = a % mod; b = b % mod; return (((a + b) % mod) + mod) % mod;}
ll sub(ll a, ll b) {a = a % mod; b = b % mod; return (((a - b) % mod) + mod) % mod;}

vector<ll> P, pre;

void Solve(){
    ll L, R;
    cin >> L >> R;
    auto lst = upper_bound(all(P), R) - P.begin(); auto fst = lower_bound(all(P), L) - P.begin();
    // for(ll i = 0; i < 5; i++) cout << P[i] << ' ';
    // cout << '\n';
    if(P[fst] >= L) fst--;
    // debug(lst - 1, fst, pre[lst - 1], pre[fst]);
    cout << (sub(pre[lst - 1] , (fst >= 0 ? pre[fst] : 0))) << '\n';
}





int main(){
    ios_base::sync_with_stdio(false);cin.tie(nullptr); cout.tie(nullptr); ll t = 1;
    cin>>t;
    for(ll i = 1; i < maxn; i++){
        P.push_back(i * i * i);
        pre.push_back((pre.empty() ? i * i * i : (add(pre.back(), i * i * i))));
    }
    for(ll i=0;i<t;i++){
        Solve();
    }   
}