#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-5;
const double pi = acos(-1.0);
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
int n, m, X, Y;
long long K, ans[110][110];
int main() {
  int i, j, t;
  long long mn = 1e18, mx = 0;
  cin >> n >> m >> K >> X >> Y;
  t = (n > 1 ? (2 * n - 2) * m : m);
  for (i = 2; i < n; i++)
    for (j = 1; j <= m; j++) ans[i][j] = K / t * 2;
  for (j = 1; j <= m; j++) ans[1][j] = ans[n][j] = K / t;
  K %= t;
  for (i = 1; i <= n; i++)
    for (j = 1; j <= m; j++)
      if (K > 0) ans[i][j]++, K--;
  for (i = n - 1; i > 1; i--)
    for (j = 1; j <= m; j++)
      if (K > 0) ans[i][j]++, K--;
  for (i = 1; i <= n; i++)
    for (j = 1; j <= m; j++) {
      mn = (mn < ans[i][j] ? mn : ans[i][j]);
      mx = (mx > ans[i][j] ? mx : ans[i][j]);
    }
  cout << mx << " " << mn << " " << ans[X][Y] << endl;
  return 0;
}
