#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, x, y;
  long long k, round, remainder;
  cin >> n >> m >> k >> x >> y;
  vector<vector<long long>> count(n, vector<long long>(m, 0));
  if (n == 1) {
    round = k / m;
    remainder = k % m;
  } else {
    round = k / ((n + n - 2) * m);
    remainder = k % ((n + n - 2) * m);
  }
  for (int c = 0; c < m; c++) {
    count[0][c] = round;
    count[n - 1][c] = round;
  }
  for (int r = 1; r < n - 1; r++)
    for (int c = 0; c < m; c++) count[r][c] = round * 2;
  if (remainder) {
    for (int i = 0; i < n; i++) {
      if (remainder) {
        for (int j = 0; j < m; j++) {
          if (remainder) {
            count[i][j]++;
            remainder--;
          } else
            break;
        }
      } else
        break;
    }
  }
  if (remainder) {
    for (int i = n - 2; i >= 0; i--) {
      if (remainder) {
        for (int j = 0; j < m; j++) {
          if (remainder) {
            count[i][j]++;
            remainder--;
          } else
            break;
        }
      } else
        break;
    }
  }
  long long maximum = count[0][0], minimum = count[0][0];
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) {
      if (count[i][j] > maximum) maximum = count[i][j];
      if (count[i][j] < minimum) minimum = count[i][j];
    }
  cout << maximum << " " << minimum << " " << count[x - 1][y - 1] << endl;
}
