#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, m, k, x, y;
  cin >> n >> m >> k >> x >> y;
  if (n == 1) {
    long long mx = k / m + (k % m != 0);
    long long mn = k / m;
    long long a = k / m + (y <= k % m);
    cout << mx << " " << mn << " " << a;
    return 0;
  }
  long long t = m * (2 * n - 2);
  long long r = k / t, rem = k % t;
  vector<long long> ans(n + 1, 2 * r);
  ans[1] = r;
  ans[n] = r;
  int row = 1;
  int flag;
  while (rem >= m) {
    ans[row]++;
    rem -= m;
    if (row == n) flag = 0;
    if (row == 1) flag = 1;
    if (n > 1 && flag == 1) {
      row++;
    } else if (n > 1 && flag == 0)
      row--;
  }
  long long mx = 0, mn = k;
  for (int i = 1; i <= n; i++) {
    mx = max(mx, ans[i]);
    mn = min(mn, ans[i]);
  }
  long long a = ans[x];
  if (rem) {
    long long a1 = ans[row] + 1;
    mx = max(mx, a1);
    if (x == row && y <= rem) {
      a = ans[row] + 1;
    }
  }
  cout << mx << " " << mn << " " << a;
  return 0;
}
