#include <bits/stdc++.h>
using namespace std;
void solve();
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int t = 1;
  for (int i = 1; i <= t; ++i) solve();
  cerr << "Time taken: " << ((clock() * 1000) / CLOCKS_PER_SEC) << "ms\n";
}
void solve() {
  long long n, m, k, x, y;
  cin >> n >> m >> k >> x >> y;
  long long temp = (n - 1) * m;
  if (n == 1) temp = m;
  long long a = k / temp;
  long long last = a / 2;
  long long one = a - last;
  long long arr[n][m];
  memset(arr, 0, sizeof(arr));
  for (long long int i = 0; i < m; ++i) {
    arr[0][i] += one;
    arr[n - 1][i] += last;
    for (long long int j = 1; j < n - 1; ++j) {
      arr[j][i] += a;
    }
  }
  k %= temp;
  long long i = 0, j = 0;
  long long mv = 1;
  if (a % 2) {
    i = n - 1;
    mv = -1;
  }
  while (k > 0) {
    arr[i][j]++;
    k--;
    ++j;
    if (j == m) {
      j = 0;
      i += mv;
      if (i == n) {
        mv = -1;
        i = n - 2;
      } else if (i == -1) {
        mv = 1;
        i = 1;
      }
    }
  }
  long long p = arr[0][0], q = arr[0][0];
  for (long long int i = 0; i < n; ++i) {
    for (long long int j = 0; j < m; ++j) {
      p = min(p, arr[i][j]);
      q = max(q, arr[i][j]);
    }
  }
  cout << q << " " << p << " " << arr[x - 1][y - 1] << '\n';
}
