#include <bits/stdc++.h>
using namespace std;
long long a[105][105];
int main() {
  long long n, m, k, x, y;
  cin >> n >> m >> k >> x >> y;
  if (n == 1) {
    long long tim = n * m;
    long long ci = k / tim;
    if (k % tim == 0) {
      cout << ci << " " << ci << " " << ci << endl;
    } else {
      cout << ci + 1 << " " << ci << " ";
      if (k % tim < y)
        cout << ci << endl;
      else
        cout << ci + 1 << endl;
    }
    return 0;
  }
  long long tim = n * m + (n - 2) * m;
  long long ci = k / tim;
  if (k % tim == 0) {
    if (n > 2) {
      cout << ci * 2 << " " << ci << " ";
      if (x == 1 || x == n)
        cout << ci << endl;
      else
        cout << ci * 2 << endl;
    } else {
      cout << ci << " " << ci << " " << ci << endl;
    }
  } else {
    long long i, j;
    for (i = 1; i <= m; i++) a[1][i] = a[n][i] = ci;
    for (i = 2; i < n; i++) {
      for (j = 1; j <= m; j++) a[i][j] = ci * 2;
    }
    long long now = 0, mo = k % tim;
    for (i = 1; i <= n; i++) {
      for (j = 1; j <= m; j++) {
        if (mo != now) {
          a[i][j]++;
          now++;
        } else
          break;
      }
      if (mo == now) break;
    }
    for (i = n - 1; i > 1; i--) {
      for (j = 1; j <= m; j++) {
        if (mo != now) {
          a[i][j]++;
          now++;
        } else
          break;
      }
      if (mo == now) break;
    }
    long long mas = 0, mix = a[1][1], ser;
    for (i = 1; i <= n; i++) {
      for (j = 1; j <= m; j++) {
        mas = max(mas, a[i][j]);
        mix = min(mix, a[i][j]);
      }
    }
    ser = a[x][y];
    printf("%lld %lld %lld\n", mas, mix, ser);
  }
  return 0;
}
