#include <bits/stdc++.h>
using namespace std;
template <class T>
T gcd(T a, T b) {
  if (!b) return a;
  return gcd(b, a % b);
}
template <class T>
T power(T a, T b) {
  T res(1);
  while (b) {
    if (b & 1) res = res * a;
    a = a * a;
    b >>= 1;
  }
  return res;
}
template <class T>
T powerM(T a, T b, T mod) {
  T res(1);
  while (b) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return res;
}
const int infi = 2147483647;
const long long infl = 9223372036854775807;
int n, m, x, y;
long long a[128][128];
long long k;
int main() {
  scanf("%d", &n), scanf("%d", &m), scanf("%lld", &k), scanf("%d", &x),
      scanf("%d", &y);
  if (n == 1) {
    long long t = k % m, b = k / m;
    for (int j = 1; j <= (m); ++j) a[1][j] = b;
    for (int j = 1; j <= (t); ++j) a[1][j]++;
  } else {
    long long t = k % (m * (n - 1)), b = k / (m * (n - 1));
    for (int i = 2; i <= n - 1; ++i)
      for (int j = 1; j <= (m); ++j) a[i][j] = b;
    for (int j = 1; j <= (m); ++j) a[1][j] = b - (b >> 1), a[n][j] = b >> 1;
    if (b & 1) {
      int c = t / m, d = t % m;
      for (int i = 1; i <= (c); ++i)
        for (int j = 1; j <= (m); ++j) a[n - i + 1][j]++;
      for (int j = 1; j <= (d); ++j) a[n - c][j]++;
    } else {
      int c = t / m, d = t % m;
      for (int i = 1; i <= (c); ++i)
        for (int j = 1; j <= (m); ++j) a[i][j]++;
      for (int j = 1; j <= (d); ++j) a[c + 1][j]++;
    }
  }
  long long aa = -infl, bb = infl;
  for (int i = 1; i <= (n); ++i)
    for (int j = 1; j <= (m); ++j) aa = max(aa, a[i][j]), bb = min(bb, a[i][j]);
  printf("%lld %lld %lld\n", aa, bb, a[x][y]);
  return 0;
}
