/* #region Head */ #include using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; using pll = pair; template using vc = vector; template using vvc = vc>; using vll = vc; using vvll = vvc; using vld = vc; using vvld = vvc; using vs = vc; using vvs = vvc; template using um = unordered_map; #define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i)) #define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i)) #define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i)) #define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d)) #define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d)) #define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++) #define ALL(x) begin(x), end(x) #define SIZE(x) ((ll)(x).size()) #define PREM(c) \ sort(all(c)); \ for (bool c##p = 1; c##p; c##p = next_permutation(all(c))) #define UNIQ(v) v.erase(unique(ALL(v)), v.end()); constexpr ll INF = 1'010'000'000'000'000'017LL; constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7 constexpr ld EPS = 1e-12; constexpr ld PI = 3.14159265358979323846; // vector 入力 template istream &operator>>(istream &is, vc &vec) { for (T &x : vec) is >> x; return is; } // vector 出力 (for dump) template ostream &operator<<(ostream &os, vc &vec) { ll len = SIZE(vec); os << "{"; for (int i = 0; i < len; i++) os << vec[i] << (i == len - 1 ? "" : ", "); os << "}"; return os; } // vector 出力 (inline) template ostream &operator>>(ostream &os, vc &vec) { ll len = SIZE(vec); for (int i = 0; i < len; i++) os << vec[i] << (i == len - 1 ? "\n" : " "); return os; } // pair 入力 template istream &operator>>(istream &is, pair &pair_var) { is >> pair_var.first >> pair_var.second; return is; } // pair 出力 template ostream &operator<<(ostream &os, pair &pair_var) { os << "(" << pair_var.first << ", " << pair_var.second << ")"; return os; } // map 出力 template ostream &operator<<(ostream &os, map &map_var) { os << "{"; REPI(itr, map_var) { os << *itr; itr++; if (itr != map_var.end()) os << ", "; itr--; } os << "}"; return os; } // um 出力 template ostream &operator<<(ostream &os, um &map_var) { os << "{"; REPI(itr, map_var) { os << *itr; auto itrcp = itr; itrcp++; if (itrcp != map_var.end()) os << ", "; } os << "}"; return os; } // set 出力 template ostream &operator<<(ostream &os, set &set_var) { os << "{"; REPI(itr, set_var) { os << *itr; itr++; if (itr != set_var.end()) os << ", "; itr--; } os << "}"; return os; } // dump #define DUMPOUT cerr void dump_func() { DUMPOUT << endl; } template void dump_func(Head &&head, Tail &&... tail) { DUMPOUT << head; if (sizeof...(Tail) > 0) { DUMPOUT << ", "; } dump_func(move(tail)...); } // chmax (更新「される」かもしれない値が前) template > bool chmax(T &xmax, const U &x, Comp comp = {}) { if (comp(xmax, x)) { xmax = x; return true; } return false; } // chmin (更新「される」かもしれない値が前) template > bool chmin(T &xmin, const U &x, Comp comp = {}) { if (comp(x, xmin)) { xmin = x; return true; } return false; } // ローカル用 #define DEBUG_ #ifdef DEBUG_ #define DEB #define dump(...) \ DUMPOUT << " " << string(#__VA_ARGS__) << ": " \ << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" \ << endl \ << " ", \ dump_func(__VA_ARGS__) #else #define DEB if (false) #define dump(...) #endif struct AtCoderInitialize { static constexpr int IOS_PREC = 15; static constexpr bool AUTOFLUSH = false; AtCoderInitialize() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cout << fixed << setprecision(IOS_PREC); if (AUTOFLUSH) cout << unitbuf; } } ATCODER_INITIALIZE; string yes = "Yes", no = "No"; // string yes = "YES", no = "NO"; /* #endregion */ /** Problem */ void solve() { ll a, b, x0, n; cin >> a >> b >> x0 >> n; ll ans1 = (x0 % 2 == 0) ? n / 2 : 0; ll ans2 = (x0 % 2 == 1) ? n / 2 : 0; cout << ans1 << " " << ans2 << endl; } /** * エントリポイント. * @return 0. */ int main() { solve(); return 0; }