#include <bits/stdc++.h>
const long long mod = 4294967296;
using namespace std;
int n, m, X, Y;
long long K, ans[110][110];
int main() {
  int i, j, t;
  long long mini = 1e18, maxi = 0;
  scanf("%d%d%lld%d%d", &n, &m, &K, &X, &Y);
  if (n > 1)
    t = (2 * n - 2) * m;
  else
    t = m;
  for (i = 2; i < n; i++) {
    for (j = 1; j <= m; j++) ans[i][j] = K / t * 2;
  }
  for (j = 1; j <= m; j++) ans[1][j] = ans[n][j] = K / t;
  K %= t;
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= m; j++) {
      if (K > 0) ans[i][j]++, K--;
    }
  }
  for (i = n - 1; i > 1; i--) {
    for (j = 1; j <= m; j++) {
      if (K > 0) ans[i][j]++, K--;
    }
  }
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= m; j++) {
      if (mini >= ans[i][j]) mini = ans[i][j];
      if (maxi <= ans[i][j]) maxi = ans[i][j];
    }
  }
  printf("%lld %lld %lld\n", maxi, mini, ans[X][Y]);
  return 0;
}
