#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, x, y;
  long long k, mx = 0, mn = 0, serjei = 0;
  cin >> n >> m >> k >> x >> y;
  if (n == 1) {
    long long div = k / (n * m);
    long long mod = k % (n * m);
    mn = div;
    mx = mn + (mod > 0);
    serjei = mn + (mod >= x * y);
    cout << mx << " " << mn << " " << serjei << endl;
    return 0;
  }
  long long mod = k % (n * m + (n - 2) * m);
  long long div = k / (n * m + (n - 2) * m);
  mn = div;
  long long f[n + 1][m + 1];
  memset(f, 0, sizeof f);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      f[i][j] = mn;
      if (i != 1 && i != n) {
        f[i][j] *= 2;
      }
      if (mod > 0) {
        f[i][j]++;
        mod--;
      }
    }
  }
  for (int i = n - 1; mod > 0 && i >= 2; i--) {
    for (int j = 1; mod > 0 && j <= m; j++) {
      if (mod > 0) {
        f[i][j]++;
        mod--;
      }
    }
  }
  mn = mx = f[1][1];
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      mn = min(mn, f[i][j]);
      mx = max(mx, f[i][j]);
    }
  }
  serjei = f[x][y];
  cout << mx << " " << mn << " " << serjei << endl;
  return 0;
}
