//Believe in yourself ,( try and try and then try ), You can do it
//You don't have to be great to start but you have to start to be great
#include <iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<vector>
#include <utility>
#include <stack>
#include <set>
#include <map>
#include<queue>
#include<set>
#include<iomanip>
// 2D vector vector<vector<int>>v(n,vector<int>(m));
// sort and reverse in vector sort(v.begin(), v.end(), greater<int>());
// str.erase(pos,len); erase in string
// a = s.substr(0, i)<<before i, b = s.substr(i)<<from i to end;
// cout << (v[0] == 1 ? "YES" : "NO") << endl;
// unsigned long long int
// priority_queue<ll, vector<ll>, greater<ll>> p;
using namespace std;
#define ll long long
#define all(c) c.begin(),c.end()
ll gcd(ll a, ll b)
{
while (b != 0)
{
ll a2 = a;
a = b; b = a2 % b;
}
return a;
}
ll lcm(ll a, ll b)
{
return a / gcd(a, b) * b;
}
void soso()
{
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
vector<ll>arr(200005);
int main()
{
soso();
for (ll i = 0; i < 100004; i++)
arr[i] = (i * (i + 1)) / 2;
int t; cin >> t;
while (t--)
{
ll l, r,ans=0; cin >> l >> r;
for (int i = 1; i < 10004; i++)
{
ll sm = l - arr[i],grat=r-arr[i];
if (grat < 0)break;
ll lo = lower_bound(arr.begin()+1, arr.end(), sm) - arr.begin();
ll upp = (upper_bound(arr.begin()+1, arr.end(), grat) - arr.begin())-1;
cout << sm << " " << lo << " " << grat << " " << upp << "\n";
ans += (upp - lo) + 1;
}
cout << ans/2 << "\n";
}
}
Ly9CZWxpZXZlIGluIHlvdXJzZWxmICwoIHRyeSBhbmQgdHJ5IGFuZCB0aGVuIHRyeSApLCBZb3UgY2FuIGRvIGl0IAovL1lvdSBkb24ndCBoYXZlIHRvIGJlIGdyZWF0IHRvIHN0YXJ0IGJ1dCB5b3UgaGF2ZSB0byBzdGFydCB0byBiZSBncmVhdCAKI2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTxhbGdvcml0aG0+CiNpbmNsdWRlPGNtYXRoPgojaW5jbHVkZTxzdHJpbmc+CiNpbmNsdWRlPHZlY3Rvcj4KI2luY2x1ZGUgPHV0aWxpdHk+CiNpbmNsdWRlIDxzdGFjaz4KI2luY2x1ZGUgPHNldD4KI2luY2x1ZGUgPG1hcD4KI2luY2x1ZGU8cXVldWU+CiNpbmNsdWRlPHNldD4KI2luY2x1ZGU8aW9tYW5pcD4KLy8gMkQgdmVjdG9yIHZlY3Rvcjx2ZWN0b3I8aW50Pj52KG4sdmVjdG9yPGludD4obSkpOwovLyBzb3J0IGFuZCByZXZlcnNlIGluIHZlY3RvciBzb3J0KHYuYmVnaW4oKSwgdi5lbmQoKSwgZ3JlYXRlcjxpbnQ+KCkpOwovLyBzdHIuZXJhc2UocG9zLGxlbik7IGVyYXNlIGluIHN0cmluZwovLyBhID0gcy5zdWJzdHIoMCwgaSk8PGJlZm9yZSBpLCBiID0gcy5zdWJzdHIoaSk8PGZyb20gaSB0byBlbmQ7Ci8vIGNvdXQgPDwgKHZbMF0gPT0gMSA/ICJZRVMiIDogIk5PIikgPDwgZW5kbDsKLy8gdW5zaWduZWQgbG9uZyBsb25nIGludAovLyBwcmlvcml0eV9xdWV1ZTxsbCwgdmVjdG9yPGxsPiwgZ3JlYXRlcjxsbD4+IHA7CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiNkZWZpbmUgbGwgbG9uZyBsb25nCiNkZWZpbmUgYWxsKGMpICBjLmJlZ2luKCksYy5lbmQoKQoKCmxsIGdjZChsbCBhLCBsbCBiKQp7CiAgICB3aGlsZSAoYiAhPSAwKQogICAgewogICAgICAgIGxsIGEyID0gYTsKICAgICAgICBhID0gYjsgICAgICAgIGIgPSBhMiAlIGI7CiAgICB9CiAgICByZXR1cm4gIGE7Cn0KCmxsIGxjbShsbCBhLCBsbCBiKQp7CiAgICByZXR1cm4gYSAvIGdjZChhLCBiKSAqIGI7Cn0KCnZvaWQgc29zbygpCnsKICAgIGlvczo6c3luY193aXRoX3N0ZGlvKDApOwogICAgY2luLnRpZShOVUxMKTsKICAgIGNvdXQudGllKE5VTEwpOwp9Cgp2ZWN0b3I8bGw+YXJyKDIwMDAwNSk7CmludCBtYWluKCkKewogICAgc29zbygpOwogICAgZm9yIChsbCBpID0gMDsgaSA8IDEwMDAwNDsgaSsrKQogICAgICAgIGFycltpXSA9IChpICogKGkgKyAxKSkgLyAyOwogICAgCiAgICBpbnQgdDsgY2luID4+IHQ7CiAgICB3aGlsZSAodC0tKQogICAgewogICAgICAgIGxsIGwsIHIsYW5zPTA7IGNpbiA+PiBsID4+IHI7CiAgICAgICAgZm9yIChpbnQgaSA9IDE7IGkgPCAxMDAwNDsgaSsrKQogICAgICAgIHsKICAgICAgICAgICAgbGwgc20gPSBsIC0gYXJyW2ldLGdyYXQ9ci1hcnJbaV07CiAgICAgICAgICAgIGlmIChncmF0IDwgMClicmVhazsKICAgICAgICAgICAgbGwgbG8gPSBsb3dlcl9ib3VuZChhcnIuYmVnaW4oKSsxLCBhcnIuZW5kKCksIHNtKSAtIGFyci5iZWdpbigpOwogICAgICAgICAgICBsbCB1cHAgPSAodXBwZXJfYm91bmQoYXJyLmJlZ2luKCkrMSwgYXJyLmVuZCgpLCBncmF0KSAtIGFyci5iZWdpbigpKS0xOwogICAgICAgICAgICBjb3V0IDw8IHNtIDw8ICIgIiA8PCBsbyA8PCAiICIgPDwgZ3JhdCA8PCAiICIgPDwgdXBwIDw8ICJcbiI7CiAgICAgICAgICAgIAogICAgICAgICAgICAgICAgYW5zICs9ICh1cHAgLSBsbykgKyAxOwogICAgICAgIH0KICAgICAgICBjb3V0IDw8IGFucy8yIDw8ICJcbiI7CiAgICB9Cn0=