#include <bits/stdc++.h>
using namespace std;
const int MAX = 123;
const int INF = 0x3f3f3f3f;
const long long MOD = 1000000007;
long long n, m, x, y;
long long resp[MAX][MAX], walk;
long long k;
void solve() {
  walk = k / ((2 * n - 2) * m);
  k %= ((2 * n - 2) * m);
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) {
      if (i == 1 || i == n)
        resp[i][j] = walk;
      else
        resp[i][j] = 2 * walk;
    }
  for (int i = 1; i <= n && k; i++)
    for (int j = 1; j <= m && k; j++) {
      resp[i][j]++;
      --k;
    }
  for (int i = n - 1; i >= 2 && k; i--)
    for (int j = 1; j <= m && k; j++) {
      resp[i][j]++;
      --k;
    }
}
int main() {
  cin >> n >> m >> k >> x >> y;
  if (n == 1) {
    cout << (k + m - 1) / m << ' ' << k / m << ' ';
    long long pos = k % m;
    if (pos == 0) pos = m;
    long long last = (pos >= y) ? ((k + m - 1) / m) : (k / m);
    cout << last << '\n';
  } else {
    solve();
    long long mx = 0, mn = (long long)1e18 + 1;
    for (int i = 1; i <= n; i++)
      for (int j = 1; j <= m; j++) {
        mn = min(mn, resp[i][j]);
        mx = max(mx, resp[i][j]);
      }
    cout << mx << ' ' << mn << ' ';
    cout << resp[x][y] << '\n';
  }
  return 0;
}
