#include <bits/stdc++.h>
using namespace std;
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
void file() {}
void fast() {
  std::ios_base::sync_with_stdio(0);
  cin.tie(NULL);
}
int main() {
  file();
  fast();
  long long n, m, k, x, y;
  cin >> n >> m >> k >> x >> y;
  if (n == 1) {
    vector<long long> v1(m, k / m);
    for (int i = 0; i < k % m; i++) v1[i]++;
    cout << *max_element(v1.begin(), v1.end()) << ' '
         << *min_element(v1.begin(), v1.end()) << ' ' << v1[y - 1] << "\n";
    return 0;
  }
  long long onestep = m + m + (n - 2) * 2 * m;
  long long can = k / onestep;
  k %= onestep;
  vector<vector<long long>> v1(n, vector<long long>(m, 2 * can));
  for (int j = 0; j < m; j++) v1[0][j] = v1[n - 1][j] = can;
  for (int i = 0; i < n && k; i++)
    for (int j = 0; j < m && k; j++) v1[i][j]++, k--;
  for (int i = n - 2; i >= 1 && k; i--)
    for (int j = 0; j < m && k; j++) v1[i][j]++, k--;
  long long mn = LLONG_MAX, mx = LLONG_MIN;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) mn = min(mn, v1[i][j]), mx = max(mx, v1[i][j]);
  cout << mx << ' ' << mn << ' ' << v1[x - 1][y - 1] << "\n";
  return 0;
}
