#include <bits/stdc++.h>
using namespace std;
long long a[109][109];
int main() {
  long long n, m, x, y, i, j, k, l, c;
  long long maxe, mine;
  cin >> n >> m >> k >> x >> y;
  if (n == 1) {
    c = k / (n * m);
    k = k % (n * m);
  } else {
    c = k / ((2 * n - 2) * m);
    k = k % ((2 * n - 2) * m);
  }
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= m; j++) {
      if (i == 1 or i == n)
        a[i][j] = c;
      else
        a[i][j] = 2 * c;
    }
  }
  while (k) {
    for (i = 1; i <= n and k; i++) {
      for (j = 1; j <= m and k; j++) {
        a[i][j]++;
        k--;
      }
    }
    for (i = n - 1; i > 1 and k; i--) {
      for (j = 1; j <= m and k; j++) {
        a[i][j]++;
        k--;
      }
    }
  }
  maxe = a[1][1];
  mine = a[1][1];
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= m; j++) {
      maxe = max(maxe, a[i][j]);
      mine = min(mine, a[i][j]);
    }
  }
  cout << maxe << " " << mine << " " << a[x][y];
}
