#include <bits/stdc++.h>
using namespace std;
const long long INF = 0x3f3f3f3f3f3f3f3fLL;
const double eps = 1E-6;
const int LEN = 110;
long long n, m, k, x, y;
long long num[LEN][LEN];
int main() {
  while (cin >> n >> m >> k >> x >> y) {
    memset(num, 0, sizeof num);
    if (n == 2) {
      m *= 2;
      n = 1;
      if (x == 2) y += m / 2;
      x = 1;
    }
    if (n == 1) {
      cout << k / m + (k % m ? 1 : 0) << ' ' << k / m << ' ';
      if (k % m >= y)
        cout << k / m + 1 << endl;
      else
        cout << k / m << endl;
      continue;
    }
    long long sz = n * m * 2 - 2 * m;
    long long tc = k / sz;
    long long lc = k % sz;
    for (int i = 0; i < n; i++)
      for (int j = 0; j < m; j++)
        if (i == 0 || i == n - 1)
          num[i][j] = tc;
        else
          num[i][j] = 2 * tc;
    for (int i = 0; i < n; i++)
      for (int j = 0; j < m; j++) {
        if (lc-- > 0)
          num[i][j]++;
        else
          break;
      }
    for (int i = n - 2; i > 0; i--)
      for (int j = 0; j < m; j++) {
        if (lc-- > 0)
          num[i][j]++;
        else
          break;
      }
    long long Max = -INF, Min = INF;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        Max = max(Max, num[i][j]);
        Min = min(Min, num[i][j]);
      }
    }
    cout << Max << ' ' << Min << ' ' << num[x - 1][y - 1] << endl;
  }
  return 0;
}
