# include <bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr int N=31;
int fib[40];
ll slv(int A,int B)
{
	if(!A || !B) return 0;
	ll ans=0;
	for(int i=0;i+2<=N;i+=2)
	{
		for(int a=1,b=0;a<=A && fib[i]*a<=A && fib[i+1]*a<=B;a++)
		{
			while(fib[i]*a+fib[i+1]*(b+1)<=A && fib[i+1]*a+fib[i+2]*(b+1)<=B) b++;
			while(fib[i]*a+fib[i+1]*b>A || fib[i+1]*a+fib[i+2]*b>B) b--;
			ans+=max(b-2*a+1,0);
		}
		for(int a=0,b=1;b<=B && fib[i]*b<=B && fib[i+1]*b<=A;b++)
		{
			while(fib[i+2]*(a+1)+fib[i+1]*b<=A && fib[i+1]*(a+1)+fib[i]*b<=B) a++;
			while(fib[i+2]*a+fib[i+1]*b>A || fib[i+1]*a+fib[i]*b>B) a--;
			ans+=max(a-2*b+1,0);
		}
	}
	return ans;
}
int main()
{
	int T,L1,L2,R1,R2;
	fib[0]=1;fib[1]=0;
	for(int i=2;i<=N;i++) fib[i]=fib[i-1]+fib[i-2];
	cin>>T;
	for(int _=1;_<=T;_++)
	{
		scanf("%d%d%d%d",&L1,&R1,&L2,&R2);
		printf("Case #%d: %lld\n",_,slv(R1,R2)-slv(L1-1,R2)-slv(R1,L2-1)+slv(L1-1,L2-1));
	}
	return 0;
}