#include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<cstdlib>

 #include<cmath>

 #include<iostream>

 #include<queue>

 #define ll long long

 using namespace std;

 ll n,m,a,c,g,x0;

 ll ans[][],b[][];

 void read(ll & xx){

     xx=;ll ff=;char ch=getchar();

     while(ch<''||ch>''){if(ch=='-')ff=-;ch=getchar();}

     while(ch>=''&&ch<=''){xx=xx*+ch-'';ch=getchar();}

     xx*=ff;

 }

 ll sum(ll x,ll y){

     ll cnt=;

     while(y){

         if(y&){

             cnt=(cnt+x)%m;

         }y>>=;x=(x+x)%m;

     }return cnt;

 }

 void add(){

         ll z[][];memset(z,,sizeof(z));

         for(int i=;i<=;i++){

             for(int j=;j<=;j++){

                 for(int k=;k<=;k++){

                     z[i][j]=(z[i][j]%m+sum(b[k][j],b[i][k])%m)%m;

                 }

             }

         }

         for(int i=;i<=;i++)

         for(int j=;j<=;j++)

             b[i][j]=z[i][j]%m;

 }

 void mul(ll y){

     while(y){

         if(y&){

             ll z[][];z[][]=z[][]=;

             for(int i=;i<=;i++){

                 for(int j=;j<=;j++){

                     for(int k=;k<=;k++){

                         z[i][j]=(z[i][j]%m+sum(ans[k][j],b[i][k])%m)%m;

                     }

                 }

             }

             ans[][]=z[][]%m;

         }

         y>>=;

         add();

     }

 }

 int main(){

     read(m),read(a),read(c),read(x0),read(n),read(g);

     ans[][]=x0%m;ans[][]=;

     b[][]=a%m;b[][]=c%m;b[][]=;

     mul(n);

     //printf("%lld",ans[1][1]%g);

     cout<<ans[][]%g;

 }