// #pragma GCC target("avx")  // CPU 処理並列化
// #pragma GCC optimize("O3")  // CPU 処理並列化
// #pragma GCC optimize("unroll-loops")  // 条件処理の呼び出しを減らす
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile("mov %%rsp, %%rbx\nmov %%rax, %%rsp":"=b"(stack_extend_origin_memory_):"a"((char*)stack_extend_memory_+(size)-1024));
// #define END_STACK_EXTEND asm volatile("mov %%rax, %%rsp"::"a"(stack_extend_origin_memory_));free(stack_extend_memory_);
 
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
#include<numeric>
#include<unordered_set>
#include<unordered_map>
#include<complex>
using namespace std;
const long long mod=1000000007;
const long long inf=mod*mod;
const long long d2=(mod+1)/2;
const double EPS=1e-9;
const double INF=1e+10;
const double PI=acos(-1.0);
const int C_SIZE = 3100000;
const int UF_SIZE = 3100000;
namespace{
	long long fact[C_SIZE];
	long long finv[C_SIZE];
	long long inv[C_SIZE];
	inline long long Comb(int a,int b){
	 	if(a<b||b<0)return 0;
	 	return fact[a]*finv[b]%mod*finv[a-b]%mod;
	}
	void init_C(int n){
		fact[0]=finv[0]=inv[1]=1;
		for(int i=2;i<n;i++){
			inv[i]=(mod-(mod/i)*inv[mod%i]%mod)%mod;
		}
		for(int i=1;i<n;i++){
			fact[i]=fact[i-1]*i%mod;
			finv[i]=finv[i-1]*inv[i]%mod;
		}
	}
	long long pw(long long a,long long b){
		if(a<0LL)return 0;
		if(b<0LL)return 0;
		long long ret=1;
		while(b){
			if(b%2)ret=ret*a%mod;
			a=a*a%mod;
			b/=2;
		}
		return ret;
	}
	long long pw_mod(long long a,long long b,long long M){
		if(a<0LL)return 0;
		if(b<0LL)return 0;
		long long ret=1;
		while(b){
			if(b%2)ret=ret*a%M;
			a=a*a%M;
			b/=2;
		}
		return ret;
	}
	int pw_mod_int(int a,int b,int M){
		if(a<0)return 0;
		if(b<0)return 0;
		int ret=1;
		while(b){
			if(b%2)ret=(long long)ret*a%M;
			a=(long long)a*a%M;
			b/=2;
		}
		return ret;
	}
	int ABS(int a){return max(a,-a);}
	long long ABS(long long a){return max(a,-a);}
	double ABS(double a){return max(a,-a);}
	int sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }
	int UF[UF_SIZE];
	void init_UF(int n){
		for(int i=0;i<n;i++)UF[i]=-1;
	}
	int FIND(int a){
		if(UF[a]<0)return a;
		return UF[a]=FIND(UF[a]);
	}
	void UNION(int a,int b){
		a=FIND(a);b=FIND(b);if(a==b)return;
		// if(UF[a]>UF[b])swap(a,b);
		UF[a]+=UF[b];UF[b]=a;
	}
}
// ここから編集しろ
pair<__int128,int>ev[310000];
int sz=0;
int main(){
	long long A,B,C,D;
	scanf("%lld%lld%lld%lld",&A,&B,&C,&D);
	__int128 T=(__int128)A*B*C;
	for(int i=1;i<=D;i++){
		if(D+i<A){
			ev[sz++]=make_pair(T/A*i,1);
			ev[sz++]=make_pair(T/A*(A-i),-1);
		}
		if(D+i<B){
			ev[sz++]=make_pair(T/B*i,2);
			ev[sz++]=make_pair(T/B*(B-i),-2);
		}
		if(D+i<C){
			ev[sz++]=make_pair(T/C*i,3);
			ev[sz++]=make_pair(T/C*(C-i),-3);
		}
 
	}
	ev[sz++]=make_pair(T,0);
	std::sort(ev,ev+sz);
	long long ret=min(D+1,A)*min(D+1,B)*min(D+1,C)%mod;
 
	long long KA=min(A,D+1);
	long long KB=min(B,D+1);
	long long KC=min(C,D+1);
	long long LA=0;
	long long LB=0;
	long long LC=0;
	for(int i=0;i<sz;i++){
		__int128 t=ev[i].first;
		int ty=ev[i].second;
		long long ta=(long long)(t/B/C);
		long long tb=(long long)(t/A/C);
		long long tc=(long long)(t/A/B);
		ret=(ret+max(0LL,(min(ta,A-1-D)-LA))*KB%mod*KC)%mod;
		ret=(ret+max(0LL,(min(tb,B-1-D)-LB))*KA%mod*KC)%mod;
		ret=(ret+max(0LL,(min(tc,C-1-D)-LC))*KA%mod*KB)%mod;
		if(ty==1)KA++;
		if(ty==2)KB++;
		if(ty==3)KC++;
		if(ty==-1)KA--;
		if(ty==-2)KB--;
		if(ty==-3)KC--;
		
		LA=ta;
		LB=tb;
		LC=tc;
	}
	ret%=mod;
	printf("%lld\n",ret);
}

Measured memory_bytes: 11208