#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using mint = modint1000000007;
const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
#include <vector>
template<typename T>
std::vector<vector<T>> matrixMul(const std::vector<std::vector<T>>&A, const std::vector<std::vector<T>>&B) {
	std::vector<vector<T>> C(A.size(), std::vector<T>(B[0].size()));
	for (int i = 0; i < (int)A.size(); ++i) {
		for (int k = 0; k < (int)A[0].size(); ++k) {
			for (int j = 0; j < (int)B[0].size(); ++j) {
				C[i][j] += A[i][k] * B[k][j];
			}
		}
	}
	return C;
}
template<typename T>
std::vector<std::vector<T>> matrixPow(long long n, const std::vector<std::vector<T>> &mat) {
	int size = (int)mat.size();
	vector<vector<mint>> mret(size, vector<mint>(size));
	for (int i = 0; i < size; ++i) {
		mret[i][i] = 1;
	}
	auto cmat = mat;
	while (n > 0) {
		if (1 & n) mret = matrixMul(cmat, mret);
		cmat = matrixMul(cmat, cmat);
		n >>= 1;
	}
	return mret;
}
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	long long a, b, c, d, e, n;
	cin >> a >> b >> c >> d >> e >> n;
	vector mat(4, vector<mint>(4));
	mat[0][0] = c;
	mat[0][1] = d;
	mat[0][2] = e;
	mat[1][0] = 1;
	mat[2][2] = 1;
	mat[3][0] = 1;
	mat[3][3] = 1;
	mat = matrixPow(n, mat);
	mint ans = 0;
	vector<mint> x = { b,a,1,a };
	rep(i, 4)ans += mat[3][i] * x[i];
	cout << ans.val() << endl;
	return 0;
}