#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18 + 18;
long long a[120][120];
int main() {
  long long n, m, k, x, y;
  cin >> n >> m >> k >> x >> y;
  long long q;
  if (n == 1)
    q = m;
  else
    q = (n - 1) * 2 * m;
  long long w = k / q, e = k % q;
  for (int i = 0; i < m; i++) {
    a[0][i] = w;
    a[n - 1][i] = w;
  }
  for (int i = 1; i < n - 1; i++) {
    for (int j = 0; j < m; j++) {
      a[i][j] = w + w;
    }
  }
  long long ee = 0;
  int z = 1;
  for (int i = 0; i < n + 1; i += z) {
    if (ee == e) break;
    if (i == n) {
      i -= 2;
      z = -1;
    }
    for (int j = 0; j < m; j++) {
      a[i][j]++;
      ee++;
      if (ee == e) break;
    }
  }
  long long mn = INF, mx = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      mn = min(mn, a[i][j]);
      mx = max(mx, a[i][j]);
    }
  }
  cout << mx << ' ' << mn << ' ' << a[x - 1][y - 1];
  return 0;
}
