#include <bits/stdc++.h>
using namespace std;
int main() {
  int a, b, k1, k2, n;
  while (cin >> a >> b >> k1 >> k2 >> n) {
    if (k1 > k2) {
      swap(k1, k2);
      swap(a, b);
    }
    int sum = a * (k1 - 1) + b * (k2 - 1);
    int mi = 0, mx = 0;
    if (sum >= n) {
      mi = 0;
    } else {
      mi = n - sum;
    }
    int c2 = min(n / k1, a);
    int y2 = n - c2 * k1;
    mx = c2;
    if (y2) {
      mx += min(b, y2 / k2);
    }
    cout << mi << " " << mx << endl;
  }
  return 0;
}
