#include <bits/stdc++.h>
using namespace std;
long long in() {
  int32_t x;
  scanf("%d", &x);
  return x;
}
long long lin() {
  long long x;
  scanf("%lld", &x);
  return x;
}
const long long maxn = 1e3 + 10;
const long long inf = 1e18 + 5;
long long a[maxn][maxn];
int32_t main() {
  long long n = in(), m = in(), k = lin(), x = in() - 1, y = in() - 1;
  long long tot = k / max(1ll, 2 * n - 2) / m;
  k %= max(1ll, 2 * n - 2) * m;
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < m; j++) {
      a[i][j] += tot;
      if (i && i - n + 1) a[i][j] += tot;
    }
  }
  for (long long i = 0; i < n; i++)
    for (long long j = 0; j < m && k; j++) k--, a[i][j]++;
  for (long long i = n - 2; i >= 0; i--)
    for (long long j = 0; j < m && k; j++) k--, a[i][j]++;
  long long mini = 2e18, maxi = -2e18;
  for (long long i = 0; i < n; i++)
    for (long long j = 0; j < m; j++)
      mini = min(mini, a[i][j]), maxi = max(maxi, a[i][j]);
  cout << maxi << " " << mini << " " << a[x][y] << "\n";
}
