import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines

A,B,C,D,E=map(int,readline().split())
move=[1]*(A+B)*(C+D)
for i in range(C+D):
    for j in range(B):
        move[j+A+i*(A+B)]=0
for i in range(A+B):
    for j in range(D):
        move[j+C+i*(C+D)]=0
ans=E//((A+B)*(C+D))*sum(move)+sum(move[:E%((A+B)*(C+D))])
print(ans)