#include <bits/stdc++.h>
using namespace std;
long long n, m, k, x, y;
long long minn, maxx, ans;
long long a[101][101];
int main() {
  maxx = 0, minn = 1e18;
  scanf("%I64d %I64d %I64d %I64d %I64d", &n, &m, &k, &x, &y);
  if (n == 1) {
    long long cnt = k % m;
    for (int i = 1; i <= cnt; i++) a[1][i]++;
    for (int i = 1; i <= m; i++) {
      maxx = max(maxx, a[1][i]);
      minn = min(minn, a[1][i]);
    }
    cout << maxx + k / m << " " << minn + k / m << " " << a[x][y] + k / m
         << endl;
    return 0;
  }
  long long sheng1 = k % ((n - 1) * m * 2);
  long long tmp = k / ((n - 1) * m * 2);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if (i == 1 || i == n)
        a[i][j] = tmp;
      else
        a[i][j] = 2LL * tmp;
    }
  }
  for (int i = 1; i <= n - 1; i++) {
    for (int j = 1; j <= m; j++) {
      if (sheng1) {
        a[i][j]++;
        sheng1--;
      } else
        break;
    }
    if (!sheng1) break;
  }
  for (int i = n; i >= 2; i--) {
    for (int j = 1; j <= m; j++) {
      if (sheng1) {
        a[i][j]++;
        sheng1--;
      } else
        break;
    }
    if (!sheng1) break;
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if (i == x && j == y) ans = a[i][j];
      maxx = max(maxx, a[i][j]);
      minn = min(minn, a[i][j]);
    }
  }
  cout << maxx << " " << minn << " " << ans << endl;
}
