#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10, M = 1e6 + 10, inf = 1e9 + 10;
const long long INF = 1e18 + 10, mod = 1e9 + 7;
long long mp[110][110];
int main() {
  long long n, m, k, x, y;
  scanf("%lld%lld%lld%lld%lld", &n, &m, &k, &x, &y);
  if (n == 1) {
    long long maxx = k / m;
    long long minn = k / m;
    long long ans = k / m;
    k = k % m;
    if (y <= k) ans++;
    if (k) maxx++;
    printf("%lld %lld %lld\n", maxx, minn, ans);
    return 0;
  }
  long long minn = (k / ((n - 1) * m * 2));
  long long maxx = (k / ((n - 1) * m * 2)) * 2;
  long long now = k % ((n - 1) * m * 2);
  long long ans;
  if (x == 1 || x == n)
    ans = (k / ((n - 1) * m * 2));
  else
    ans = (k / ((n - 1) * m * 2)) * 2;
  int st = 1;
  int en = 1;
  int up = 1;
  while (1) {
    for (int i = 1; i <= m; i++) {
      if (now <= 0) break;
      now--;
      mp[st][i]++;
      if (st == x && i == y) ans++;
    }
    if (now <= 0) break;
    st += up;
    if (st == n) up = -1;
  }
  long long minnn = INF, maxxx = 0;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++)
      if (i == 1 || i == n)
        mp[i][j] += minn;
      else
        mp[i][j] += maxx;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++)
      minnn = min(minnn, mp[i][j]), maxxx = max(maxxx, mp[i][j]);
  printf("%lld %lld %lld\n", maxxx, minnn, mp[x][y]);
  return 0;
}
