#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <vector>

using namespace std;

#define file_in "fibo3.in"
#define file_out "fibo3.out"

#define nmax 1111

int Q;
long long F[nmax];

void citire()
{
    freopen(file_in,"r",stdin);
    freopen(file_out,"w",stdout);

    scanf("%d", &Q);

}

void precalculare()
{
    int i;
    F[1]=F[2]=1;
	for (i=3;i<=100;++i)
		F[i]=(F[i-1]+F[i-2]);
}

void solve()
{
    long long i,j,nrsol,k;
    long long x1,x2,y1,y2;
     precalculare();

     while(Q--)
     {
        scanf("%lld %lld %lld %lld", &x1, &y1, &x2, &y2);
        nrsol=0;
         for (i=x1;i<=x2;++i)
              for (j=y1;j<=y2;++j)
                   if (binary_search(F+1,F+100+1,i+j))
                      nrsol++;
        printf("%lld\n", nrsol);
     }

}

int main()
{
    citire();
    solve();

    fclose(stdin);
    fclose(stdout);

    return 0;
}