#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000007;
const int maxn = 100005;
long long a[200][200];
long long n, m, k, x, y;
int main() {
  scanf("%I64d %I64d %I64d %I64d %I64d", &n, &m, &k, &x, &y);
  long long mx = -1ll, mi = k + 1ll;
  long long s = n * m + max(0ll, n - 2ll) * m;
  long long tot = k / s;
  k %= s;
  for (long long i = 1; i <= m; ++i) {
    a[1][i] = a[n][i] = tot;
    for (long long j = 2; j < n; ++j) a[j][i] = tot * 2;
  }
  while (k > 0) {
    for (long long i = 1; i <= n && k > 0; ++i) {
      for (long long j = 1; j <= m && k > 0; ++j) {
        ++a[i][j];
        --k;
      }
    }
    for (long long i = n - 1; i >= 2 && k > 0; --i) {
      for (long long j = 1; j <= m && k > 0; ++j) {
        ++a[i][j];
        --k;
      }
    }
  }
  for (long long i = 1; i <= n; ++i)
    for (long long j = 1; j <= m; ++j) {
      mx = max(mx, a[i][j]);
      mi = min(mi, a[i][j]);
    }
  printf("%I64d %I64d %I64d\n", mx, mi, a[x][y]);
}
