#include <bits/stdc++.h>
using namespace std;
long long int power(long long int x, long long int y, long long int p) {
  long long int res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
priority_queue<long long int> Q;
int main() {
  ios_base::sync_with_stdio(false);
  long long int n, i, j, k, x, y, t, m, a1, a2, k1, k2;
  cin >> a1 >> a2;
  cin >> k1 >> k2;
  cin >> n;
  long long int mn, mx;
  mn = max(0ll, n - (a1 * (k1 - 1) + a2 * (k2 - 1)));
  if (k1 < k2) {
    mx = min(n / k1, a1);
    n -= mx * k1;
    y = min(n / k2, a2);
    n -= mn * k2;
    mx += y;
  } else {
    mx = min(n / k2, a2);
    n -= mx * k2;
    y = min(n / k1, a1);
    n -= mn * k1;
    mx += y;
  }
  cout << mn << " " << mx << endl;
}
