学步园

#include<bits/stdc++.h>
using namespace std;
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
const int maxn = 50001;
int n,a,b,c,d,k,tot,mu[maxn],sum[maxn],prime[maxn];
bool mark[maxn];
inline void get(){
    mu[1]=1;
    for(int i=2;i<=50000;i++){
        if(!mark[i])prime[++tot]=i,mu[i]=-1;
        for(int j=1;j<=tot&&i*prime[j]<=50000;j++){
            mark[i*prime[j]]=1;
            if(i%prime[j]==0){mu[i*prime[j]]=0;break;}
            else mu[i*prime[j]]=-mu[i];
        }
    }
    for(int i=1;i<=50000;i++)
        sum[i]=sum[i-1]+mu[i];
}
inline int work(int n,int m){  
	if(n>m)swap(n,m);
    int ans=0,pos;  
    for(int i=1;i<=n;i=pos+1){  
        pos=min(n/(n/i),m/(m/i));  
        ans+=(sum[pos]-sum[i-1])*(n/i)*(m/i);  
    }
    return ans;  
}  
int main(){
    n=read();
    get();
    while(n--){
        a=read()-1,b=read(),c=read()-1,d=read(),k=read();
        a/=k;b/=k;c/=k;d/=k;
        printf("%d\n",work(a,c)+work(b,d)-work(a,d)-work(b,c));
    }
    return 0;
}