#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define all(a) (a).begin(), (a).end() #define rep(i, n) for (ll i = 0; i < (n); i++) #define range(i, a, b) for (ll i = (a); i < (b); i++) #define pb push_back #define debug(x) cerr << __LINE__ << ' ' << #x << ':' << (x) << '\n' #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") using namespace std; typedef long long ll; typedef unsigned int uint; typedef unsigned long long ull; typedef long double ld; typedef pair P; typedef complex com; template using pri_s = priority_queue, greater>; template using pri_b = priority_queue; constexpr int inf = 1000000010; constexpr ll INF = 1000000000000000010; constexpr int mod1e9 = 1000000007; constexpr int mod998 = 998244353; constexpr ld eps = 1e-12; constexpr ld pi = 3.141592653589793238; constexpr ll ten(int n) { return n ? 10 * ten(n - 1) : 1; }; int dx[] = { 1,0,-1,0,1,1,-1,-1 }; int dy[] = { 0,1,0,-1,1,-1,1,-1 }; ll mul(ll a, ll b) { return (a > INF / b ? INF : a * b); } void fail() { cout << "-1\n"; exit(0); } void no() { cout << "No\n"; exit(0); } template void er(T a) { cout << a << '\n'; exit(0); } template inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; } template istream &operator >> (istream &s, vector &v) { for (auto &e : v) s >> e; return s; } template ostream &operator << (ostream &s, const vector &v) { for (auto &e : v) s << e << ' '; return s; } template ostream &operator << (ostream &s, const pair &p) { s << p.first << ' ' << p.second; return s; } struct fastio { fastio() { cin.tie(0); cout.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); cerr << fixed << setprecision(20); } }fastio_; int main() { int a, b, c, d, e; cin >> a >> b >> c >> d >> e; int n = (a + b) * (c + d); vector x(n); int cnt = 0; rep(i, n) { if (i % (a + b) < a) x[i]++; if (i % (c + d) < c) x[i]++; if (x[i] == 2) cnt++; } int ans = e / n * cnt; e %= n; rep(i, e) if (x[i] == 2) ans++; cout << ans << '\n'; }