#include static inline constexpr void mul(std::array, 2>& result, const std::array, 2>& a, const std::array, 2>& b, const uint_fast32_t K) noexcept { for (uint_fast32_t i = 0; i != 2; ++i) for (uint_fast32_t j = 0; j != 2; ++j) result[i][j] = (static_cast(a[i][0]) * b[0][j] + static_cast(a[i][1]) * b[1][j]) % K; } static inline constexpr std::array, 2> prepare(const std::array, 2>& M, const uint_fast32_t K) noexcept { std::array, 2> new_M = { { 0, }, }; for (uint_fast32_t i = 0; i != 2; ++i) for (uint_fast32_t j = 0; j != 2; ++j) new_M[i][j] = (M[i][j] + K * UINT64_C(50'000'000)) % K; return new_M; } static inline constexpr std::pair solve(const std::array, 2>& M, const uint_fast32_t S, const uint_fast32_t T, const uint_fast64_t N, const uint_fast32_t K) noexcept { std::array, 2>, 2> ans_dp = { std::array, 2>{ std::array{ 1, 0 }, std::array{ 0, 1 } }, std::array, 2>{ std::array{ 1, 0 }, std::array{ 0, 1 } } }; std::array, 2>, 2> base_dp = { M, { { 0, }, } }; for (uint_fast32_t i = 0; i != 60; ++i) { if ((N >> i) & 1) mul(ans_dp[(i & 1) ^ 1], ans_dp[i & 1], base_dp[i & 1], K); else ans_dp[(i & 1) ^ 1] = ans_dp[i & 1]; mul(base_dp[(i & 1) ^ 1], base_dp[i & 1], base_dp[i & 1], K); } return { (static_cast(ans_dp[0][0][0]) * S + static_cast(ans_dp[0][0][1]) * T) % K, (static_cast(ans_dp[0][1][0]) * S + static_cast(ans_dp[0][1][1]) * T) % K }; } static inline void output(const std::pair& ans) noexcept { std::cout << ans.first << ' ' << ans.second << '\n'; } int main() { std::cin.tie(nullptr); std::ios::sync_with_stdio(false); std::array, 2> M; int_fast32_t S, T; uint_fast64_t N; uint_fast32_t K, i, j; for (i = 0; i != 2; ++i) for (j = 0; j != 2; ++j) std::cin >> M[i][j]; std::cin >> S >> T >> N >> K; output(solve(prepare(M, K), (S + K * UINT64_C(50'000'000)) % K, (T + K * UINT64_C(50'000'000)) % K, N, K)); return 0; }