#include <bits/stdc++.h>
using namespace std;
long long n, m, k, a[101][101], qx, qy, maxn, minn = 1e18 + 5;
inline long long max(long long x, long long y) { return x > y ? x : y; }
inline long long min(long long x, long long y) { return x > y ? y : x; }
long long getnum() {
  long long ans = 0;
  bool f = 1;
  char c = getchar();
  while (!isdigit(c)) {
    if (c == '-') f = 0;
    c = getchar();
  }
  while (isdigit(c)) {
    ans = ans * 10 + c - '0';
    c = getchar();
  }
  return f ? ans : -ans;
}
int main() {
  n = getnum(), m = getnum(), k = getnum(), qx = getnum(), qy = getnum();
  if (n > 1) {
    long long mod = n * m + (n - 2) * m;
    long long p = k / mod;
    long long rmn = k % mod;
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        a[i][j] += p;
        if (rmn) {
          --rmn;
          a[i][j]++;
        }
      }
    }
    for (int i = n - 1; i >= 2; i--) {
      for (int j = 1; j <= m; j++) {
        a[i][j] += p;
        if (rmn) {
          --rmn;
          a[i][j]++;
        }
      }
    }
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        maxn = max(maxn, a[i][j]);
        minn = min(minn, a[i][j]);
      }
    }
    cout << maxn << " " << minn << " " << a[qx][qy];
  } else {
    long long p = k / m;
    long long rmn = k % m;
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        a[i][j] += p;
        if (rmn) {
          --rmn;
          a[i][j]++;
        }
      }
    }
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        maxn = max(maxn, a[i][j]);
        minn = min(minn, a[i][j]);
      }
    }
    cout << maxn << " " << minn << " " << a[qx][qy];
  }
  return 0;
}
