#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<stdlib.h>
#include<math.h>
#include<map>
#include<queue>
#include<vector>
using namespace std;
long long a,b,c,d,e;
int main()
{
	long long y;
	while(~scanf("%lld %lld %lld %lld %lld",&a,&b,&c,&d,&e)){
		long long v=a*b*c;
		if(d<e){
			y=(b-2*e)*(c-2*e)*2*d+(b-2*e)*(a-2*e)*2*d+(c-2*e)*(a-2*e)*2*d;
			printf("%lld\n",v-y);
		} 
		else{
		
			long long w=(a-2*d)*(b-2*d)*(c-2*d);
			y=a*c*e-(a-2*e)*(c-2*e)*e;y*=2;
			y+=(b-2*e)*e*e*4;
			printf("%lld\n",max(w,y));
		}
		
	
	}
}