#include <bits/stdc++.h>
using namespace std;
long long M[1000][1000];
long long n, m, k, x, y, Total, Res, Opc, Div, Cont;
void Imprimir() {
  cout << "-----------------" << endl;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cout << M[i][j] << " ";
    }
    cout << endl;
  }
  cout << "----------------" << endl;
  return;
}
int main() {
  while (cin >> n >> m >> k >> x >> y) {
    x--;
    y--;
    for (long long i = 0; i < n; i++) {
      for (long long j = 0; j < m; j++) {
        M[i][j] = 0;
      }
    }
    if (n == 1) {
      if (k % m == 0)
        cout << (k / m) << " ";
      else
        cout << (k / m) + 1 << " ";
      if (k % m == 0)
        cout << (k / m) << " ";
      else
        cout << (k / m) << " ";
      if ((k % m) - 1 >= y)
        cout << (k / m) + 1 << endl;
      else
        cout << (k / m) << endl;
      continue;
    }
    Total = (n - 1) * m;
    Res = k % Total;
    Div = k / Total;
    if (Div % 2 == 0) {
      Opc = 0;
    } else {
      Opc = 1;
    }
    Cont = 1;
    long long pab = Div / 2, par = Div / 2;
    if (Div % 2 == 1) pab++;
    for (int i = 0; i < n - 1; i++) {
      for (int j = 0; j < m; j++) {
        M[i][j] += pab;
      }
    }
    for (int i = n - 1; i >= 1; i--) {
      for (int j = 0; j < m; j++) {
        M[i][j] += par;
      }
    }
    if (Opc == 0) {
      for (long long i = 0; i < n && Cont <= Res; i++) {
        for (long long j = 0; j < m && Cont <= Res; j++) {
          M[i][j] += 1;
          Cont++;
        }
      }
    } else {
      for (long long i = n - 1; i >= 1 && Cont <= Res; i--) {
        for (long long j = 0; j < m && Cont <= Res; j++) {
          M[i][j] += 1;
          Cont++;
        }
      }
    }
    long long Maxi = 0, Mini = 200000000000000000, Se = 0;
    for (long long i = 0; i < n; i++) {
      for (long long j = 0; j < m; j++) {
        Maxi = max(Maxi, M[i][j]);
        Mini = min(Mini, M[i][j]);
        if (i == x && j == y) {
          Se = M[i][j];
        }
      }
    }
    cout << Maxi << " " << Mini << " " << Se << endl;
  }
  return 0;
}
