#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, m, k, x, y;
  cin >> n >> m >> k >> x >> y;
  long long a[n + 2][m + 2];
  memset(a, 0, sizeof(a));
  if (n == 1) {
    long long v = k / m;
    k %= m;
    for (int i = 0; i < m; i++) {
      a[0][i] = v;
      if (k) {
        a[0][i]++;
        k--;
      }
    }
    cout << a[0][0] << ' ' << a[0][m - 1] << ' ' << a[x - 1][y - 1];
    return 0;
  }
  long long v = k / (m * (2 * n - 2));
  for (int i = 1; i < n - 1; i++) {
    for (int j = 0; j < m; j++) {
      a[i][j] = 2 * v;
    }
  }
  for (int i = 0; i < m; i++) {
    a[0][i] = v;
    a[n - 1][i] = v;
  }
  k %= (m * (2 * n - 2));
  for (int i = 0; i < n && k; i++) {
    for (int j = 0; j < m && k; j++) {
      a[i][j]++;
      k--;
    }
  }
  for (int i = n - 2; i >= 0 && k; i--) {
    for (int j = 0; j < m && k; j++) {
      a[i][j]++;
      k--;
    }
  }
  cout << max(a[0][0], max(a[n - 1][m - 1], max(a[1][0], a[n - 2][0])));
  cout << ' ' << min(a[0][0], min(a[n - 1][m - 1], min(a[1][0], a[n - 2][0])));
  cout << ' ' << a[x - 1][y - 1];
}
