#include<bits/stdc++.h>

 #define CLR(a,x) memset(a,x,sizeof(a))

 #define MP make_pair

 using namespace std;

 typedef long long ll;

 typedef unsigned long long ull;

 typedef pair<int,int> pa;

 const int maxn=;

 const ll P=1e9+,PP=P*(P-);

 inline ll fmul(ll x,ll y){

     ll re=;

     while(y){

         if(y&) re=(re+x)%PP;

         x=(x+x)%PP,y>>=;

     }return re;

 }

 inline ll rd(){

     ll x=;char c=getchar();int neg=;

     while(c<''||c>''){if(c=='-') neg=-;c=getchar();}

     while(c>=''&&c<='') x=(fmul(x,)+c-'')%PP,c=getchar();

     return x*neg;

 }

 inline ll fpow(ll x,ll y){

     ll re=;

     while(y){

         if(y&) re=re*x%P;

         x=x*x%P,y>>=;

     }

     return re;

 }

 int main(){

     // freopen("testdata.in","r",stdin);

     ll n=(rd()-+PP)%PP,m=(rd()-+PP)%PP,a=rd(),b=rd(),c=rd(),d=rd();

     ll e=fpow(a,m),f;

     if(a!=) f=(e-)*fpow(a-,P-)%P*b%P;

     else f=m%P*b%P;

     ll g=e*c%P,h=(f*c%P+d)%P;

     ll i=fpow(g,n),j;

     if(g!=) j=(i-)*fpow(g-,P-)%P*h%P;

     else j=n%P*h%P;

     printf("%lld\n",((e*(i+j)+f)%P+P)%P);

     return ;

 }