#include <bits/stdc++.h>
using namespace std;
const long long MAX = 1e18;
long long n, m, k, x, y, chia, mi, ma;
long long a[101][101];
signed main() {
  cin >> n >> m >> k >> x >> y;
  long long ans = 0;
  if (n == 1 || n == 2) {
    chia = n * m;
    ma = k / chia + (k % chia > 0);
    mi = k / chia;
    ans = k / chia;
    k %= chia;
    for (long long i = 1; i <= n; i++) {
      if (k == 0) break;
      for (long long j = 1; j <= m; j++) {
        if (k == 0) break;
        if (i == x && j == y) ans++;
        k--;
      }
    }
    cout << ma << " " << mi << " " << ans;
    return 0;
  }
  long long chia = (n - 1) * m;
  long long ma = k / chia;
  long long mi = MAX;
  for (long long i = 1; i <= n; i++) {
    for (long long j = 1; j <= m; j++) {
      if (i == 1 || i == n)
        a[i][j] = k / chia / 2 + (i == 1 && k / chia % 2 == 1);
      else
        a[i][j] = k / chia;
    }
  }
  long long du = k % chia;
  if (k / chia % 2 == 0) {
    for (long long i = 1; i <= n; i++) {
      for (long long j = 1; j <= m; j++) {
        if (du <= 0) break;
        a[i][j]++;
        ma = max(a[i][j], ma);
        du--;
      }
      if (du <= 0) break;
    }
  } else {
    for (long long i = n; i >= 1; i--) {
      for (long long j = 1; j <= m; j++) {
        if (du <= 0) break;
        a[i][j]++;
        du--;
        ma = max(a[i][j], ma);
      }
      if (du <= 0) break;
    }
  }
  mi = a[n][m];
  cout << ma << " " << mi << " " << a[x][y];
}
