#include <bits/stdc++.h>
using namespace std;
int n, m, x, y;
long long Max, Min, k, ti, T, a[110][110];
void cal() {
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) {
      a[i][j]++;
      k--;
      if (k == 0) return;
    }
  for (int i = n - 1; i > 1; i--)
    for (int j = 1; j <= m; j++) {
      a[i][j]++;
      k--;
      if (k == 0) return;
    }
  return;
}
void print() {
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) printf("%I64d ", a[i][j]);
    printf("\n");
  }
  return;
}
int main() {
  while (scanf("%d %d %I64d %d %d", &n, &m, &k, &x, &y) != EOF) {
    if (n == 1) {
      ti = k / m;
      k %= m;
      for (int i = 1; i <= m; i++) a[1][i] = ti;
      for (int i = 1; i <= m; i++)
        if (k) a[1][i]++, k--;
    } else {
      T = (2 * n - 2) * m;
      ti = k / T;
      k %= T;
      for (int i = 2; i < n; i++)
        for (int j = 1; j <= m; j++) a[i][j] = 2 * ti;
      for (int j = 1; j <= m; j++) a[1][j] = a[n][j] = ti;
      if (k) cal();
    }
    Max = 0, Min = 1e18;
    for (int i = 1; i <= n; i++)
      for (int j = 1; j <= m; j++) {
        Max = max(a[i][j], Max);
        Min = min(a[i][j], Min);
      }
    printf("%I64d %I64d %I64d\n", Max, Min, a[x][y]);
  }
  return 0;
}
