#include <bits/stdc++.h>
using namespace std;
long long int Max, Min;
void Max_Min(long long int L, long long int F, long long int Middle);
long long int Max_Min_Single_Row(int N, int M, long long int k, int y);
long long int Max_Min_Double_Row(int N, int M, long long int k, int x, int y);
int main(void) {
  int N, M, x, y;
  long long int F, L, Middle, k, Sergei, Questions, Rem, Q;
  cin >> N >> M >> k >> x >> y;
  Questions = M * (N - 1);
  if (N == 1) {
    Sergei = Max_Min_Single_Row(N, M, k, y);
    cout << Max << " " << Min << " " << Sergei << " " << endl;
    return 0;
  }
  if (N == 2) {
    Sergei = Max_Min_Double_Row(N, M, k, x, y);
    cout << Max << " " << Min << " " << Sergei << " " << endl;
    return 0;
  }
  if (k <= M * N) {
    if (k == M * N)
      Max = Min = Sergei = 1;
    else {
      Max = 1;
      Min = 0;
      if (k >= (x - 1) * M + y)
        Sergei = 1;
      else
        Sergei = 0;
    }
  } else {
    Max = Min = Sergei = F = L = Middle = 1;
    Rem = k - (N * M);
    if (Rem >= Questions) {
      Middle = Q = Rem / Questions;
      Rem = Rem % Questions;
      if (Q % 2) {
        L += Middle / 2;
        F += (Middle / 2) + 1;
      } else {
        F += (Middle / 2);
        L += (Middle / 2);
      }
      Middle++;
    }
    Max_Min(L, F, Middle);
    if (x == N)
      Sergei = L;
    else if (x == 1)
      Sergei = F;
    else
      Sergei = Middle;
    if (Rem) {
      Max++;
      if (!(Q % 2)) {
        if (x != N) {
          if (Rem >= (N - 1 - x) * M + y) Sergei++;
        }
      } else {
        if (x != 1) {
          if (Rem >= (x - 2) * M + y) Sergei++;
        }
      }
    }
  }
  cout << Max << " " << Min << " " << Sergei << " " << endl;
  return 0;
}
void Max_Min(long long int L, long long int F, long long int Middle) {
  Max = Min = L;
  if (F > Max) Max = F;
  if (Middle > Max) Max = Middle;
  if (F < Min) Min = F;
  if (Middle < Min) Min = Middle;
}
long long int Max_Min_Single_Row(int N, int M, long long int k, int y) {
  long long int Sergei;
  Max = Min = Sergei = k / (N * M);
  if (k % (N * M)) {
    Max++;
    if (k % (N * M) >= y) Sergei++;
  }
  return Sergei++;
}
long long int Max_Min_Double_Row(int N, int M, long long int k, int x, int y) {
  long long int Sergei, Rem;
  Sergei = Min = Max = k / (2 * M);
  Rem = k % (2 * M);
  if (Rem) {
    Max++;
    if (Rem >= (x - 1) * M + y) Sergei++;
  }
  return Sergei;
}
