#include <bits/stdc++.h>
using namespace std;
inline int ri() {
  int x;
  scanf("%d", &x);
  return x;
}
template <typename T>
inline bool smax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool smin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
int main() {
  int n, m, x, y;
  long long k;
  scanf("%d %d %I64d %d %d", &n, &m, &k, &x, &y);
  long long rows = k / m;
  int cols = k % m;
  long long max = 0, min = 0, him = 0;
  long long loops = (n > 1 ? rows / (2 * n - 2) : rows);
  rows = (n > 1 ? rows % (2 * n - 2) : 0);
  max += (n > 2 ? 2 : 1) * loops;
  min += loops;
  him += ((x == 1 || x == n) ? 1 : 2) * loops;
  if ((n > 2 && (rows > 1 || (rows == 1 && cols > 0))) ||
      (n <= 2 && (rows > 0 || cols > 0)))
    max++;
  if (rows > n || (rows == n && cols > 0)) max++;
  if (max == 0 && k > 0) max = 1;
  if (rows >= n) min++;
  if (rows >= x || (rows == x - 1 && cols >= y)) him++;
  if (x != 1 && x != n &&
      (rows >= 2 * n - x || (rows == 2 * n - x - 1 && cols >= y)))
    him++;
  cout << max << ' ' << min << ' ' << him << endl;
  return 0;
}
