#include <bits/stdc++.h>
using namespace std;
struct debugger {
  template <typename T>
  debugger &operator,(const T &v) {
    cerr << v << " ";
    return *this;
  }
} dbg;
inline long long gcd(long long a, long long b) {
  a = ((a) < 0 ? -(a) : (a));
  b = ((b) < 0 ? -(b) : (b));
  while (b) {
    a = a % b;
    swap(a, b);
  }
  return a;
}
long long ext_gcd(long long A, long long B, long long *X, long long *Y) {
  long long x2, y2, x1, y1, x, y, r2, r1, q, r;
  x2 = 1;
  y2 = 0;
  x1 = 0;
  y1 = 1;
  for (r2 = A, r1 = B; r1 != 0;
       r2 = r1, r1 = r, x2 = x1, y2 = y1, x1 = x, y1 = y) {
    q = r2 / r1;
    r = r2 % r1;
    x = x2 - (q * x1);
    y = y2 - (q * y1);
  }
  *X = x2;
  *Y = y2;
  return r2;
}
inline long long modInv(long long a, long long m) {
  long long x, y;
  ext_gcd(a, m, &x, &y);
  x %= m;
  if (x < 0) x += m;
  return x;
}
inline long long power(long long a, long long p) {
  long long res = 1, x = a;
  while (p) {
    if (p & 1) res = (res * x);
    x = (x * x);
    p >>= 1;
  }
  return res;
}
inline long long bigmod(long long a, long long p, long long m) {
  long long res = 1 % m, x = a % m;
  while (p) {
    if (p & 1) res = (res * x) % m;
    x = (x * x) % m;
    p >>= 1;
  }
  return res;
}
inline int STRLEN(char *s) {
  int p = 0;
  while (s[p]) p++;
  return p;
}
inline long long SQRT(long long a) {
  long long v = sqrt(a);
  if (((v) * (v)) == a)
    return v;
  else if (((v + 1) * (v + 1)) == a)
    return v + 1;
  else if (((v + 2) * (v + 2)) == a)
    return v + 2;
  else
    return -1;
}
const long long inf = 10000000000000000;
const double pi = 2 * acos(0.0);
const double eps = 1e-9;
long long N, M, K, x, y;
long long Mat[105][105];
bool fff = true;
void BRT1() {
  for (int i = 1; i <= N; i++) {
    for (int j = 1; j <= M; j++) {
      if (K == 0) return;
      Mat[i][j]++;
      K--;
    }
  }
}
void doMath() {
  if (K == 0) return;
  long long total = N * M * 2LL - M * 2LL;
  long long cnt = K / total;
  K -= (cnt * total);
  for (int i = 1; i <= N; i++) {
    for (int j = 1; j <= M; j++) {
      if (i == 1 || i == N)
        Mat[i][j] += cnt * 1LL;
      else
        Mat[i][j] += cnt * 2LL;
    }
  }
}
void BRT2() {
  for (int i = N - 1; i >= 1; i--) {
    for (int j = 1; j <= M; j++) {
      if (K == 0) return;
      Mat[i][j]++;
      K--;
    }
  }
  for (int i = 2; i <= N; i++) {
    for (int j = 1; j <= M; j++) {
      if (K == 0) return;
      Mat[i][j]++;
      K--;
    }
  }
}
void solve() {
  if (N == 1) {
    long long cnt = K / M;
    K -= cnt * M;
    for (int i = 1; i <= M; i++) {
      Mat[1][i] += cnt;
    }
    for (int i = 1; i <= M; i++) {
      if (K == 0) break;
      Mat[1][i]++;
      K--;
    }
  } else {
    BRT1();
    doMath();
    BRT2();
  }
  long long Mn, Mx;
  Mn = Mx = Mat[1][1];
  for (int i = 1; i <= N; i++) {
    for (int j = 1; j <= M; j++) {
      Mn = min(Mn, Mat[i][j]);
      Mx = max(Mx, Mat[i][j]);
    }
  }
  printf("%lld %lld %lld\n", Mx, Mn, Mat[x][y]);
}
int main() {
  cin >> N >> M >> K >> x >> y;
  memset(Mat, 0, sizeof(Mat));
  solve();
  return 0;
}
