#include <bits/stdc++.h>
using namespace std;
long long kol, md;
long long n, m, k;
long long how(long long x, long long y) {
  long long ans = 0;
  if (x == 1 || x == n) {
    ans = kol;
    if (x == 1) {
      if (md >= y)
        return ans + 1;
      else
        return ans;
    } else {
      if (md >= (n - 1) * m + y)
        return ans + 1;
      else
        return ans;
    }
  } else
    ans = 2 * kol;
  if (md > n * m) {
    ans++;
    if (md - (n * m) >= ((n - x - 1) * m) + y) ans++;
  } else {
    if (md >= m * (x - 1) + y) ans++;
  }
  return ans;
}
int main() {
  long long x, y;
  cin >> n >> m >> k >> x >> y;
  if (n <= 2) {
    if (n == 1) {
      kol = k / m;
      md = k % m;
    } else {
      kol = k / (2 * m);
      md = k % (2 * m);
    }
  } else {
    kol = k / ((2 * m) + ((n - 2) * 2 * m));
    md = k % ((2 * m) + ((n - 2) * 2 * m));
  }
  long long maxx = how(1, 1), minx = how(1, 1);
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) {
      maxx = max(maxx, how(i, j));
      minx = min(minx, how(i, j));
    }
  cout << maxx << ' ' << minx << ' ' << how(x, y) << endl;
}
