using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static long[] NList => ReadLine().Split().Select(long.Parse).ToArray();
    static long[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var m = NArr(2);
        var c = NList;
        var s = new long[2][] { new long[1] { c[0] }, new long[1] { c[1] } };
        c = NList;
        var (n, r) = (c[0], (int)c[1]);
        for (var i = 0; i < 2; ++i) for (var j = 0; j < 2; ++j) m[i][j] = (m[i][j] % r + r) % r;
        for (var i = 0; i < 2; ++i) s[i][0] = (s[i][0] % r + r) % r;
        var ans = Matrix.Mul(Matrix.Pow(m, n, r), s, r);
        WriteLine($"{ans[0][0]} {ans[1][0]}");
    }
    class Matrix
    {
        // 行列の累乗
        public static long[][] Pow(long[][] m, long k, int mod)
        {
            var multi = m;
            var r = new long[m.Length][];
            for (var i = 0; i < m.Length; ++i)
            {
                r[i] = new long[m.Length];
                r[i][i] = 1;
            }
            while (k > 0)
            {
                if ((k & 1) == 1) r = Mul(r, multi, mod);
                multi = Mul(multi, multi, mod);
                k >>= 1;
            }
            return r;
        }
        // 行列の積
        public static long[][] Mul(long[][] x, long[][] y, int mod)
        {
            var r = new long[x.Length][];
            for (var i = 0; i < x.Length; ++i) r[i] = new long[y[0].Length];
            for (var i = 0; i < x.Length; ++i) for (var k = 0; k < x[0].Length; ++k)
                {
                    for (var j = 0; j < y[0].Length; ++j) r[i][j] = (r[i][j] + x[i][k] * y[k][j]) % mod;
                }
            return r;
        }
    }
}