#include<stdio.h>
long n,i,j;
long long f[100],x1,x2,y1,y2,s;
int main()
{
 freopen("fibo3.in","r",stdin);
 freopen("fibo3.out","w",stdout);
 scanf("%ld",&n);
 f[0]=f[1]=1;
 for(i=2;i<92;++i)f[i]=f[i-2]+f[i-1];
 for(i=1;i<=n;++i)
    {scanf("%lld%lld%lld%lld",&x1,&y1,&x2,&y2);
     s=0;
     for(j=1;j<92;++j)
        {if(x1+y1>f[j])continue;
         if(x2+y2<f[j])break;
         s+=((x2>f[j]-y1)?f[j]-y1:x2);
         s-=((x1<f[j]-y2)?f[j]-y2:x1);
         s+=1;}
     printf("%lld\n",s);}
 return 0;
}