#include <bits/stdc++.h>
using namespace std;
long long qtd[101][101], k;
int n, m, x, y;
int main() {
  long long k;
  int n, m;
  scanf("%d %d %lli %d %d", &n, &m, &k, &x, &y);
  if (n == 1) {
    long long q = k / m;
    k -= q * m;
    for (int j = 1; j <= m; j++) qtd[1][j] += q;
    for (int j = 1; j <= m && k--; j++) qtd[1][j]++;
  } else {
    long long lado = m * (n - 1), tudo = m * n;
    long long q = min(tudo, k);
    k -= q;
    for (int i = 1; i <= n; i++)
      for (int j = 1; j <= m && q > 0; j++) {
        qtd[i][j]++;
        q--;
      }
    long long completo = k / lado;
    k -= lado * completo;
    long long e = completo / 2, d = completo / 2 + completo % 2;
    for (int i = 2; i <= n; i++)
      for (int j = 1; j <= m; j++) {
        qtd[i][j] += e;
      }
    for (int i = 1; i < n; i++)
      for (int j = 1; j <= m; j++) {
        qtd[i][j] += d;
      }
    if ((e + d) & 1) {
      for (int i = 2; i <= n; i++)
        for (int j = 1; j <= m && k > 0; j++) {
          qtd[i][j]++;
          k--;
        }
    } else {
      for (int i = n - 1; i >= 1; i--)
        for (int j = 1; j <= m && k > 0; j++) {
          qtd[i][j]++;
          k--;
        }
    }
  }
  long long maior = -1;
  long long menor = 1e18, mlk = -1;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if (i == x && j == y) mlk = qtd[i][j];
      maior = max(maior, qtd[i][j]);
      menor = min(menor, qtd[i][j]);
    }
  }
  printf("%lli %lli %lli\n", maior, menor, mlk);
  return 0;
}
