#include <bits/stdc++.h>
using namespace std;
long long vis[220][220], k;
const long long INF = 2e18;
int n, m, nn, mod, rest, x, y;
long long mx, mn, q;
int main() {
  cin >> n >> m >> k >> x >> y;
  if (n == 1) {
    q = k / m;
    rest = k % m;
    for (int i = 1; i <= m; i++) vis[1][i] = q;
    for (int i = 1; i <= rest; i++) vis[1][i]++;
    mx = 0, mn = INF;
    for (int i = 1; i <= m; i++) {
      mx = max(vis[1][i], mx);
      mn = min(vis[1][i], mn);
    }
    cout << mx << " " << mn << " " << vis[x][y] << endl;
  } else {
    nn = n * 2 - 2;
    mod = nn * m;
    q = k / (1ll * mod);
    rest = k % mod;
    for (int i = 1; i <= mod; i++) {
      int jj = ((i - 1) % m) + 1;
      int ii = (i - 1) / m + 1;
      if (ii > n) ii = 2 * n - ii;
      assert(ii <= n);
      assert(jj <= m);
      vis[ii][jj] += q;
    }
    for (int i = 1; i <= rest; i++) {
      int jj = ((i - 1) % m) + 1;
      int ii = (i - 1) / m + 1;
      if (ii > n) ii = 2 * n - ii;
      assert(ii <= n);
      assert(jj <= m);
      vis[ii][jj] += 1;
    }
    mx = 0, mn = INF;
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        mx = max(vis[i][j], mx);
        mn = min(vis[i][j], mn);
      }
    }
    cout << mx << " " << mn << " " << vis[x][y] << endl;
  }
}
