#include <iostream>
#include <bits/stdc++.h>
#include <cstring>
#include <vector>
#include <unordered_map>
#include <queue>
#include <set>
#include <algorithm>
#define x first
#define y second
#define pb emplace_back
#define fu(i,a,b) for(int i=a;i<=b; ++ i)
#define fd(i,a,b) for(int i=a;i>=b; -- i)
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<vector<LL>> VVL;
typedef vector<vector<int>> VVI;
typedef vector<LL> VL;
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef vector<PII> VPII;
typedef pair<PII,int> PIII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<int,char> PIC;
typedef pair<LL,LL> PLL;
typedef __int128 i128;
typedef unsigned long long ULL;
const int N =2e6+ 10,M = N * 2,base =400 ,INF = 0x3f3f3f3f,P = 131;
const double eps = 1e-8;
const int mod = 998244353;
const LL LNF=(LL) INF * INF;
LL a[M],s[M];
// n * (n + 1 ) /2 >= 1e12 n >= 1e6+
LL get(LL x)
{
int l=0,r =N;
while(l < r)
{
int mid = l + r + 1 >> 1 ;
if(a[mid] > x )r = mid -1;
else l = mid ;
}
// a[r] <= x
return s[r] + a[x - a[r]] ;
// 前r个块的 和 + 当前这个块内 1~x-a[r] 的和
}
inline void solve()
{
fu(i,1,N)
{
a[i] = a[i-1] + i ; // 前i个块中 的元素个数,也是1~i的前缀和
s[i] = s[i-1] + a[i];// 前i个 块 的 和
}
int t ;cin >> t ;
LL l,r;
while(t -- )
{
cin >> l >> r ;
cout << get(r) - get(l-1) << endl;
}
}
signed main()
{
// freopen("1.txt","r",stdin);
#define int long long
ios
// cout << fixed<<setprecision(2);
int t=1;
// cin>>t;
int now = 1;
while(t -- )
{
// cout<<"Case ";
// cout<<"Case #";
// cout<<"Scenario #";
// cout<< now ++ <<": ";
// cout<< now ++ <<": \n";
solve();
}
return 0;
}