#include <bits/stdc++.h>
using namespace std;
int book[105][105];
int main() {
  int n, m, x, y;
  long long k;
  scanf("%d%d%lld%d%d", &n, &m, &k, &x, &y);
  long long mmax = 0, mmin = 0, ans = 0;
  if (n == 1) {
    mmin = k / m;
    mmax = mmin + (k % m ? 1 : 0);
    ans = mmin + (k % m >= y ? 1 : 0);
  } else if (n == 2) {
    mmin = k / (n * m);
    mmax = mmin + (k % (n * m) ? 1 : 0);
    ans = mmin + (k % (n * m) >= (x - 1) * m + y ? 1 : 0);
  } else {
    long long t = (k / ((2 * n - 2) * m));
    mmax = 2 * t;
    mmin = t;
    int tt = k - (k / ((2 * n - 2) * m)) * ((2 * n - 2) * m);
    int g = tt;
    for (int i = 1; i <= min(tt, m); i++) book[1][i]++;
    tt -= m;
    int r = 1, c = 0, flag = 1, F = 0;
    while (tt > 0) {
      F = 1;
      if (tt >= m) {
        tt -= m;
        if (r == n) {
          if (tt) {
            flag = 0;
          }
          r--;
          c = m;
          for (int i = 1; i <= c; i++) book[r][i]++;
          continue;
        }
        if (flag)
          r++;
        else
          r--;
        c = m;
      } else {
        if (r == n)
          r--;
        else if (flag)
          r++;
        else
          r--;
        c = tt;
        tt = 0;
      }
      for (int i = 1; i <= c; i++) book[r][i]++;
    }
    if (x == 1 || x == n)
      ans += t;
    else
      ans += 2 * t;
    int Max = 0, Min = 0x3f3f3f3f;
    for (int i = 1; i <= n; i++)
      for (int j = 1; j <= m; j++) {
        Max = max(Max, book[i][j]);
        Min = min(Min, book[i][j]);
      }
    if (F || !t) mmax += Max;
    if (Min != 0x3f3f3f3f) mmin += Min;
    ans += book[x][y];
  }
  printf("%lld %lld %lld\n", mmax, mmin, ans);
  return 0;
}
