#include <bits/stdc++.h>
using namespace std;
long long a[105][105];
int main() {
  long long n, m, k, x, y;
  cin >> n >> m >> k >> x >> y;
  long long r = 0;
  long long d = 0;
  long long c = 0;
  if (n == 1) {
    d = k / (m);
    r = k % m;
    for (int i = 1; i <= m; i++) a[1][i] = d;
    for (int i = 1; i <= m; i++) {
      if (r) {
        a[1][i]++;
        r--;
      }
    }
    long long ma = 0;
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        ma = max(ma, a[i][j]);
      }
    }
    long long mi = ma, an = 0;
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        mi = min(mi, a[i][j]);
      }
    }
    an = a[x][y];
    cout << ma << " " << mi << " " << an;
    return 0;
  }
  for (int i = 1; i <= m; i++) {
    if (k) {
      a[1][i]++;
      k--;
    }
  }
  d = k / (m * (n - 1) * 2);
  r = k % (m * (n - 1) * 2);
  for (int i = 1; i <= m; i++) {
    a[1][i] += d;
    a[n][i] += d;
  }
  for (int i = 2; i < n; i++) {
    for (int j = 1; j <= m; j++) {
      a[i][j] += d * 2;
    }
  }
  for (int i = 2; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if (r) {
        a[i][j]++;
        r--;
      }
    }
  }
  for (int i = n - 1; i >= 1; i--) {
    for (int j = 1; j <= m; j++) {
      if (r) {
        a[i][j]++;
        r--;
      }
    }
  }
  long long ma = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      ma = max(ma, a[i][j]);
    }
  }
  long long mi = ma, an = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      mi = min(mi, a[i][j]);
    }
  }
  an = a[x][y];
  cout << ma << " " << mi << " " << an;
  return 0;
}
