#include <bits/stdc++.h>
int main() {
  int n, m, x, y, it;
  int64_t r, min, max, ser, k;
  std::cin >> n >> m >> k >> x >> y;
  std::vector<std::vector<int64_t>> serg(n);
  if (n == 1) {
    min = k / m;
    max = min + (k % m != 0);
    ser = min + (k % m - y >= 0);
  } else {
    r = k % (2 * m * (n - 1));
    min = k / (2 * m * (n - 1));
    for (int i = 0; i < n; i++) {
      serg[i].resize(m);
    }
    for (int i = 0; i < m; i++) {
      serg[0][i] = min;
      serg[n - 1][i] = min;
    }
    for (int i = 1; i < n - 1; i++) {
      for (int j = 0; j < m; j++) {
        serg[i][j] = 2 * min;
      }
    }
    for (int i = 0; r != 0; i++) {
      if (i >= n) {
        it = 2 * n - i - 2;
      } else {
        it = i;
      }
      for (int j = 0; r != 0 && j < m; j++) {
        serg[it][j]++;
        r--;
      }
    }
    ser = serg[x - 1][y - 1];
    min += 4;
    max = 0;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        max = std::max(max, serg[i][j]);
        min = std::min(min, serg[i][j]);
      }
    }
  }
  std::cout << max << ' ' << min << ' ' << ser;
}
