#include <bits/stdc++.h>
using namespace std;
int masala = 0;
int tot = 0;
vector<int> visited(100001, 0);
long long mod = 1e9 + 7;
vector<int> adj[100001];
int main() {
  int a1, a2, k1, k2, n;
  cin >> a1 >> a2 >> k1 >> k2 >> n;
  int minn = (a1) * (k1 - 1) + a2 * (k2 - 1);
  cout << (max(0, n - minn)) << " ";
  vector<int> v;
  if (k1 < k2) {
    int temp = a1;
    a1 = a2;
    a2 = temp;
    int kk = k2;
    k2 = k1;
    k1 = kk;
  }
  for (int i = 0; i < a2; i++) {
    v.push_back(k2);
  }
  for (int i = 0; i < a1; i++) {
    v.push_back(k1);
  }
  int add = 0;
  int get = 0;
  for (int i = 0; i < v.size(); i++) {
    get += v[i];
    if (get <= n) {
      add++;
    } else {
      break;
    }
  }
  cout << add;
  return 0;
}
