#include <fstream>
#include <algorithm>
#include <cstdio>

using namespace std;

long long fi[128],i,n,x1,x2,y1,y2,sol;

int main ()
{
	
	ifstream f ("fibo3.in");
	freopen ("fibo3.out","w",stdout);
	fi[1]=fi[2]=1;
	for(i=3;i<=100;++i)
		fi[i]=fi[i-1]+fi[i-2];
	for(f>>n;n;--n){
		sol=0;
		f>>x1>>y1>>x2>>y2;
		for(i=2;fi[i]<x1+y1;++i);
		for(;i<=100&&fi[i]<=x2+y2;++i)
			sol+=min(x2,fi[i]-y1)-max(x1,fi[i]-y2)+1;
		printf("%lld\n",sol);
		}
	
	return 0;}