#include <bits/stdc++.h>
using namespace std;
const int M = 101;
int n, m, x, y;
long long k;
long long a[M][M];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cin >> n >> m >> k >> x >> y;
  long long mn = 0, mx = 0, sr = 0;
  if (n == 1) {
    mn = 5e18;
    long long r = k % m;
    for (int i = 1; i <= m; i++) {
      a[1][i] += k / m;
      if (r) a[1][i] += 1, r--;
      mn = min(mn, a[1][i]);
      mx = max(mx, a[1][i]);
    }
    return cout << mx << " " << mn << " " << a[x][y], 0;
  }
  bool f = k == n * m;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) {
      k--;
      a[i][j]++;
      if (i == x && j == y) sr = 1;
      mx = 1;
      if (!k) return cout << mx << " " << f << " " << sr, 0;
    }
  mn = 5e18;
  long long r = k % ((n - 1) * m);
  long long d = k / ((n - 1) * m);
  for (int i = 1; i <= m; i++) a[1][i] += (d / 2) + (d % 2);
  for (int i = 1; i <= m; i++) a[n][i] += (d / 2);
  for (int i = 2; i < n; i++)
    for (int j = 1; j <= m; j++) a[i][j] += d;
  if (d % 2 == 0) {
    for (int i = n - 1; i >= 1; i--) {
      if (!r) break;
      for (int j = 1; j <= m; j++) {
        r--;
        a[i][j]++;
        if (!r) break;
      }
    }
  } else {
    for (int i = 2; i <= n; i++) {
      if (!r) break;
      for (int j = 1; j <= m; j++) {
        r--;
        a[i][j]++;
        if (!r) break;
      }
    }
  }
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) {
      mn = min(mn, a[i][j]);
      mx = max(mx, a[i][j]);
    }
  cout << mx << " " << mn << " " << a[x][y];
  return 0;
}
