#include <bits/stdc++.h>
using namespace std;
const int M = 1e2 + 10;
long long int n, m, x, y, cnt[M][M], ask, mx, mn = 1e18;
void go(long long int k, long long int i, long long int j, long long int dir) {
  if (k == 0) return;
  cnt[i][j]++;
  if (j < m)
    go(k - 1, i, j + 1, dir);
  else if (dir == 1 && i < n)
    go(k - 1, i + 1, 1, dir);
  else if (dir == -1)
    go(k - 1, i - 1, 1, dir);
  else if (i == n)
    go(k - 1, i - 1, 1, -1);
}
int main() {
  long long int k, K;
  cin >> n >> m >> K >> x >> y;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) {
      if (n == 1)
        cnt[i][j] = K / m;
      else if (i == 1)
        cnt[i][j] = K / ((2 * n - 2) * m);
      else if (i == n)
        cnt[i][j] = K / ((2 * n - 2) * m);
      else
        cnt[i][j] = (K / ((2 * n - 2) * m)) * 2;
      ask += cnt[i][j];
    }
  K -= ask;
  go(K, 1, 1, 1);
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++)
      mx = max(mx, cnt[i][j]), mn = min(mn, cnt[i][j]);
  cout << mx << " " << mn << " " << cnt[x][y];
  return 0;
}
