#include <bits/stdc++.h>
using namespace std;
long long mod = 998244353;
long long mod1 = 1e9 + 7;
long long n, m, k, x, y;
void solve() {
  cin >> n >> m >> k >> x >> y;
  long long z = (n == 1) ? m : (2 * n - 2) * m;
  long long a = k / z;
  k %= z;
  vector<long long> ans(n + 1, a);
  for (int i = 2; i < n; i++) ans[i] += a;
  int i = 1, j = -1;
  while (i <= n) {
    if (k >= m) {
      k -= m;
      ans[i]++;
      i++;
    } else {
      j = i;
      break;
    }
  }
  if (j == -1) i = n - 1;
  if (j == -1)
    while (i > 0) {
      if (k >= m)
        k -= m, ans[i]++, i--;
      else {
        j = i;
        break;
      }
    }
  long long m1 = -1, m2 = 1e18;
  for (int i = 1; i <= n; i++) m2 = min(ans[i], m2), m1 = max(ans[i], m1);
  if (k > 0 && j != -1 && ans[j] == m1) m1++;
  long long m3 = ans[x];
  if (j == x && k >= y) m3++;
  cout << m1 << " " << m2 << " " << m3;
}
int main() {
  cin.tie(NULL);
  cout.tie(NULL);
  ios_base::sync_with_stdio(false);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
