#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n, m, k, x, y;
  cin >> n >> m >> k >> x >> y;
  long long int all = n * m;
  long long int maxn = 0;
  long long int minn = 0;
  long long int ser = 0;
  long long int mod = 0;
  long long int prex;
  long long int prey;
  bool if_head = false;
  if (n > 2 && k >= all) {
    mod++;
    k -= all;
    maxn += mod;
    minn += mod;
    ser += mod;
    long long int fac = (n - 1) * m * 2;
    mod = k / fac;
    maxn += 2 * mod;
    minn += mod;
    if (x == 1 || x == n)
      ser += mod;
    else
      ser += mod * 2;
    k %= fac;
    fac = (n - 1) * m;
    if (k > fac) {
      if (x != n) ser++;
      maxn++;
      k %= fac;
      if (k != 0) maxn++;
      if (x != 1) {
        prex = k / m + 2;
        prey = k - (prex - 2) * m;
        if (prex > x || (prex == x && (prey >= y))) ser++;
      }
    } else {
      if (k != 0) maxn++;
      prex = n - 1 - (k / m);
      prey = k % m;
      if (x != n && ((x > prex) || ((x == prex) && (y <= prey)))) ser++;
    }
  } else if (n == 2 && k >= all) {
    mod = k / (m * n);
    maxn += mod;
    minn += mod;
    ser += mod;
    k %= (m * 2);
    if (k != 0) maxn++;
    if (k > m && x == 1)
      ser++;
    else if (k < m && x == 1 && k >= y)
      ser++;
    else if (k > m && x == 2 && k - m >= y)
      ser++;
  } else if (n == 1 && k >= all) {
    mod = k / m;
    maxn += mod;
    minn += mod;
    ser += mod;
    k %= m;
    if (k != 0) maxn++;
    if (k >= y) ser++;
  } else {
    maxn = 1;
    minn = 0;
    prex = k / m + 1;
    prey = k - (prex - 1) * m;
    if (prex > x)
      ser = 1;
    else if (prex == x && prey >= y)
      ser = 1;
    else
      ser = 0;
  }
  cout << maxn << " " << minn << " " << ser << endl;
  return 0;
}
