#include <bits/stdc++.h>
using int_t = long long int;
int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  int_t n;
  int_t m;
  int_t k;
  int_t x;
  int_t y;
  std::cin >> n >> m >> k >> x >> y;
  --x;
  --y;
  int_t period = n * 2 - 2;
  if (n == 1) {
    period = 1;
  }
  period *= m;
  int_t base = k / period;
  k %= period;
  std::vector<int_t> count(n * m);
  std::fill(count.begin(), count.begin() + m, base);
  std::fill(count.rbegin(), count.rbegin() + m, base);
  for (int_t i = 1; i < n - 1; ++i) {
    std::fill(count.begin() + i * m, count.begin() + (i + 1) * m, 2 * base);
  }
  int_t curr_x = 0;
  int_t curr_y = 0;
  bool increasing = true;
  while (k > 0) {
    ++count[curr_x * m + curr_y];
    ++curr_y;
    --k;
    if (curr_y == m) {
      if (n == 1) {
        curr_y = 0;
      } else {
        if (increasing) {
          ++curr_x;
          if (curr_x == n) {
            curr_x = n - 2;
            increasing = false;
          }
        } else {
          --curr_x;
          if (curr_x < 0) {
            curr_x = 1;
            increasing = true;
          }
        }
      }
      curr_y = 0;
    }
  }
  std::cout << *std::max_element(count.begin(), count.end()) << ' '
            << *std::min_element(count.begin(), count.end()) << ' '
            << count[x * m + y] << '\n';
  return 0;
}
