#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;

int main() {
  int a, b;
  cin >> a >> b;
  int c, d, e;
  cin >> c >> d >> e;
  int l = lcm(a+b, c+d);
  int ans = 0;
  int m = e % l;
  int p = 0, ab = 0, cd = 0;
  rep(i, l) {
    if(ab < a && cd < c) {
      p++;
      if(i < m) ans++;
    }
    ab++; cd++;
    ab %= a+b; cd %= c+d;
  }
  ans += (e / l) * p;
  cout << ans << endl;
  return 0;
}