#include <bits/stdc++.h>
using namespace std;
long long N, M, K, X, Y, rep, mn = 8e18, mx, me;
long long lol[110][110];
int main() {
  scanf("%lld %lld %lld %lld %lld", &N, &M, &K, &X, &Y);
  long long mult = (N == 1ll ? 1ll : (N * 2 - 2)) * M;
  rep = K / mult, K -= rep * mult;
  for (int i = (2); i < (N); i++) {
    for (int j = (1); j < (M + 1); j++) {
      lol[i][j] = rep * 2;
    }
  }
  for (int j = (1); j < (M + 1); j++) lol[1][j] = lol[N][j] = rep;
  for (int i = (1); i < (N + 1); i++) {
    for (int j = (1); j < (M + 1); j++) {
      if (K) {
        K--, lol[i][j]++;
      }
    }
  }
  for (long long i = N - 1; i >= 2; i--) {
    for (int j = (1); j < (M + 1); j++) {
      if (K) {
        K--, lol[i][j]++;
      }
    }
  }
  assert(!K);
  for (int i = (1); i < (N + 1); i++) {
    for (int j = (1); j < (M + 1); j++) {
      mn = min(mn, lol[i][j]);
      mx = max(mx, lol[i][j]);
      if (i == X && j == Y) {
        me = lol[i][j];
      }
    }
  }
  printf("%lld %lld %lld\n", mx, mn, me);
  return 0;
}
