func_code_string: #include <bits/stdc++.h>   using namespace std;   int main() {     std::ios::sync_with_stdio(0);     long long n, m, k, x, y;     cin >> n >> m >> k >> x >> y;     long long ti = (n * m) + ((n - 2) * m);     if (n == 1 || n == 2) ti = n * m;     long long upd = 0, mid = 0;     long long a[110][110];     long long num = k / ti;     long long rem = k % ti;     upd = num;     mid = 2 * num;     long long ma = mid, mi = upd, ans;     if (n == 1 || n == 2) {       ma = mi;     }     if (x - 1 == 0 || x - 1 == n - 1)       ans = mi;     else       ans = ma;     if (rem == 0) {       cout << ma <<     << mi <<     << ans << endl;       return 0;     }     long long flag = 0;     if (rem != 0) {       for (long long i = 0; i < n; ++i)         for (long long j = 0; j < m; ++j) {           if (i == 0 || i == n - 1) {             a[i][j] = upd;           } else {             a[i][j] = mid;           }         }       for (long long i = 0; i < n; ++i) {         for (long long j = 0; j < m; ++j) {           if (i == 0 || i == n - 1) {             a[i][j]++;             rem--;           } else {             a[i][j]++;             rem--;           }           if (rem == 0) {             flag = 1;             break;           }         }         if (flag) break;       }     }     flag = 0;     if (rem != 0) {       for (long long i = n - 2; i > 0; i--) {         for (long long j = 0; j < m; ++j) {           a[i][j]++;           rem--;           if (rem == 0) {             flag = 1;             break;           }         }         if (flag) break;       }     }     ma = -INFINITY, mi = INFINITY;     for (long long i = 0; i < n; ++i)       for (long long j = 0; j < m; ++j) {         ma = max(a[i][j], ma);         mi = min(a[i][j], mi);         if (i == x - 1 && j == y - 1) {           ans = a[i][j];         }       }     cout << ma <<     << mi <<     << ans << endl;     return 0;   }   