#include <cstdio>
#include <cstring>
#include <vector>
#include <cmath>
#include <stack>
#include <cstdlib>
#include <queue>
#include <map>
#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>using namespace std;
typedef long long LL;
const int MAXN = 1000000;
bool check[MAXN+10];
int prime[MAXN+10];
int mu[MAXN+10];
void Moblus()
{memset(check,false,sizeof(check));mu[1] = 1;int tot = 0;for(int i = 2; i <= MAXN; i++){if( !check[i] ){prime[tot++] = i;mu[i] = -1;}for(int j = 0; j < tot; j++){if(i * prime[j] > MAXN) break;check[i * prime[j]] = true;if( i % prime[j] == 0){mu[i * prime[j]] = 0;break;}else{mu[i * prime[j]] = -mu[i];}}}
}
int main()
{Moblus();LL T,ncas=1;scanf ("%I64d",&T);while (T--){LL a,b,c,d,k;scanf ("%I64d%I64d%I64d%I64d%I64d",&a,&b,&c,&d,&k);if (b>d) swap(b,d);if (k==0){printf ("Case %I64d: 0\n",ncas++);continue;}b/=k;d/=k;LL ans1=0;for (LL i=1;i<=b;i++){ans1+=1ll*mu[i]*(b/i)*(d/i);}LL ans2=0;for (LL i=1;i<=b;i++){ans2+=1ll*mu[i]*(b/i)*(b/i);}printf ("Case %I64d: %I64d\n",ncas++,ans1-ans2/2);}return 0;
}

#include <cstdio>
#include <cstring>
#include <vector>
#include <cmath>
#include <stack>
#include <cstdlib>
#include <queue>
#include <map>
#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>using namespace std;
typedef long long LL;
const long long MAXN = 1000000;
bool check[MAXN+10];
long long prime[MAXN+10];
long long mu[MAXN+10],sum[MAXN+10];
void Moblus()
{memset(check,false,sizeof(check));mu[1] = 1;long long tot = 0;for(long long i = 2; i <= MAXN; i++){if( !check[i] ){prime[tot++] = i;mu[i] = -1;}for(long long j = 0; j < tot; j++){if(i * prime[j] > MAXN) break;check[i * prime[j]] = true;if( i % prime[j] == 0){mu[i * prime[j]] = 0;break;}else{mu[i * prime[j]] = -mu[i];}}}sum[0]=0;for (long long i=1;i<=MAXN;i++)sum[i]=mu[i]+sum[i-1];
}
LL solve(long long t1,long long t2)
{if (t1>t2) swap(t1,t2);LL ans=0;long long j;for (long long i=1;i<=t1;i=j+1){j=min(t1/(t1/i),t2/(t2/i));ans+=1ll*(sum[j]-sum[i-1])*(t1/i)*(t2/i);}return ans;
}
int main()
{Moblus();LL T;int ncas=1;scanf ("%I64d",&T);while (T--){
//        printf ("Case %d: ",ncas++);
        LL a,b,c,d,k;scanf ("%I64d%I64d%I64d%I64d%I64d",&a,&b,&c,&d,&k);b/=k,d/=k;a=ceil(a*1.0/k);c=ceil(c*1.0/k);printf ("%I64d\n",solve(b,d)-solve(a-1,d)-solve(b,c-1)+solve(a-1,c-1));}return 0;
}