#include<fstream>

using namespace std;

ifstream f ("fibo3.in");
ofstream g ("fibo3.out");

int n,i,j;
long long v[76], a, b, c, d,nr;

int main()
{
    v[1] = v[2] = 1;
    for (i = 3; i <= 75; i++)
        v[i] = v[i - 1] + v[i - 2];
    f >> n;

    for (i = 1; i <= n; i++)
    {
        f >> a >> b >> c >> d;
        j = 2;
        nr = 0;
        while (v[j] < a + b)
        {
            j++;
        }
        while (v[j] <= c + d)
        {
            nr = nr + min(c, v[j] - b) - max(a, v[j] - d) + 1;
            j++;
        }
        g << nr << '\n';
    }
    g.close();
    return 0;
}