#include <bits/stdc++.h>
using namespace std;
const long long INF = 1 << 28;
const long long LINF = 1ll << 61;
long long n, m, k, x, y, cnt[111][111];
int main() {
  cin >> n >> m >> k >> x >> y;
  if (n == 1) {
    if (k % m == 0)
      cout << k / m << " " << k / m << " " << k / m << endl;
    else
      cout << k / m + 1 << " " << k / m << " " << k / m + (y <= (k - 1) % m + 1)
           << endl;
  } else {
    long long times = k / ((2 * n - 2) * m);
    for (int i = 1; i <= n; i++)
      for (int j = 1; j <= m; j++) {
        if (i == 1 || i == n)
          cnt[i][j] = times;
        else
          cnt[i][j] = times * 2;
      }
    long long tx = 1, ty = 1;
    k -= times * (2 * n - 2) * m;
    int dir = 1;
    while (k--) {
      cnt[tx][ty]++;
      if (ty < m)
        ty++;
      else if (ty == m) {
        ty = 1;
        if (tx == 1)
          tx++, dir = 1;
        else if (tx == n)
          tx--, dir = -1;
        else
          tx += dir;
      }
    }
    long long mn = cnt[1][1], mx = mn;
    for (int i = 1; i <= n; i++)
      for (int j = 1; j <= m; j++) {
        mn = min(mn, cnt[i][j]);
        mx = max(mx, cnt[i][j]);
      }
    cout << mx << " " << mn << " " << cnt[x][y] << endl;
  }
  return 0;
}
