#include <bits/stdc++.h>
using namespace std;
long long mp[105][105];
int main() {
  long long n, m, k, x, y;
  cin >> n >> m >> k >> x >> y;
  long long all = 0;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) all++;
  for (int i = n - 1; i >= 2; i--)
    for (int j = 1; j <= m; j++) all++;
  long long cnt = k / all;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) mp[i][j] += cnt;
  for (int i = n - 1; i >= 2; i--)
    for (int j = 1; j <= m; j++) mp[i][j] += cnt;
  long long r = k - cnt * all;
  for (int i = 1; i <= n && r; i++)
    for (int j = 1; j <= m && r; j++) mp[i][j]++, r--;
  for (int i = n - 1; i >= 2 && r; i--)
    for (int j = 1; j <= m && r; j++) mp[i][j]++, r--;
  long long mx = -1, mi = (1LL << 60);
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) mx = max(mx, mp[i][j]), mi = min(mi, mp[i][j]);
  printf("%lld %lld %lld\n", mx, mi, mp[x][y]);
  return 0;
}
