#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

template<class T>
using square_matrix=std::vector<std::vector<T>>;
template<class T,T (*add_op)(T,T),T(*add_e)(),T (*mul_op)(T,T),T(*mul_e)()>
square_matrix<T> mul_matrix(square_matrix<T> l,square_matrix<T> r){
    int n=l.size();
    assert((int)l[0].size()==n&&(int)r.size()==n&&(int)r[0].size()==n);
    square_matrix<T> val(n,std::vector<T>(n,add_e()));
    for(int i=0;i<n;i++) for(int j=0;j<n;j++) for(int k=0;k<n;k++){
                val[i][k]=add_op(val[i][k],mul_op(l[i][j],r[j][k]));
            }
    return val;
}
template<class T,T (*add_op)(T,T),T(*add_e)(),T (*mul_op)(T,T),T(*mul_e)()>
square_matrix<T> pow_matrix(square_matrix<T> l,long long times){
    int n=l.size();
    square_matrix<T> val(n,std::vector<T>(n,add_e()));
    for(int i=0;i<n;i++) val[i][i]=mul_e();
    while(times){
        if(times&1){
            val=mul_matrix<T,add_op,add_e,mul_op,mul_e>(val,l);
        }
        l=mul_matrix<T,add_op,add_e,mul_op,mul_e>(l,l);
        times>>=1;
    }
    return val;
}

#include <atcoder/modint>
using mint = atcoder::modint1000000007;

using mat_F=mint;
mat_F add_op(mat_F a,mat_F b){
    return a+b;
}
mat_F add_e(){
    return 0;
}
mat_F mul_op(mat_F a,mat_F b){
    return a*b;
}
mat_F mul_e(){
    return 1;
}
#define calc mat_F,add_op,add_e,mul_op,mul_e

void solve();
// POP'N ROLL MUSIC / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    ll a, b, c, d, e, N;
    cin >> a >> b >> c >> d >> e >> N;
    vector base(4, vector<mint>(4));
    base[1][0] = 1;
    base[2][2] = 1;
    base[3][3] = 1;
    base[0][2] = 1;
    base[0][1] = d;
    base[1][1] = c;
    base[3][1] = e;
    base = pow_matrix<calc>(base, N + 1);
    mint ans = base[0][2] * a + base[1][2] * b + base[3][2];
    cout << ans.val() << "\n";
}