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 c = NList;
        var (a, b, y, x, e, n) = (c[0], c[1], c[2], c[3], c[4], c[5]);
        var mod = 1_000_000_007;
        a = (a % mod + mod) % mod;
        b = (b % mod + mod) % mod;
        y = (y % mod + mod) % mod;
        x = (x % mod + mod) % mod;
        e = (e % mod + mod) % mod;
        if (n == 0) WriteLine(a);
        else if (n == 1) WriteLine(b);
        else
        {
            var p = new long[1][] { new long[] { a, b, 1, (a + b) % mod } };
            var r = new long[4][] {
                new long[] { 0, x, 0, x },
                new long[] { 1, y, 0, y },
                new long[] { 0, e, 1, e },
                new long[] { 0, 0, 0, 1 }
            };
            var q = Matrix.Mul(p, Matrix.Pow(r, n - 1));
            WriteLine(q[0][3]);
        }
    }
    class Matrix
    {
        static int mod = 1_000_000_007;
        // 行列の累乗
        public static long[][] Pow(long[][] m, long k)
        {
            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);
                multi = Mul(multi, multi);
                k >>= 1;
            }
            return r;
        }
        // 行列の積
        public static long[][] Mul(long[][] x, long[][] y)
        {
            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;
        }
    }
}