#include<stdio.h>

#include<string.h>

#include<algorithm>

#include<math.h>

using namespace std;

typedef long long ll;

#define MAXN 105

struct node

{

    ll z[][];

};

ll Quick(ll a,ll b,ll c)

{

    ll ans=;

    while(b>)

    {

        if(b%==)

            ans=(ans*a)%c;

        b/=;

        a=(a*a)%c;

    }

    return ans;

}

ll p;

node mou(node a,node b)

{

    node c;

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

    {

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

        {

            ll sum=;

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

                sum=(sum+a.z[i][k]*b.z[k][j])%p;

            c.z[i][j]=sum;

        }

    }

    return c;

}

int main()

{

    ll x1,y1,z1,y2,z2;

    while(scanf("%lld%lld%lld",&x1,&y1,&z1)!=EOF)

    {

        if(x1==-&&y1==-&&z1==-)

            break;

        scanf("%lld%lld%lld",&y2,&z2,&p);

        ll q=(Quick(x1,y1,p)+z1)%p;

        node s,a,ans;

        ans.z[][]=;

        ans.z[][]=;

        ans.z[][]=;

        ans.z[][]=;

        a.z[][]=;

        a.z[][]=q;

        a.z[][]=;

        a.z[][]=q-;

        s=a;

        while(z2>)

        {

            if(z2%==)

                ans=mou(ans,a);

            z2=z2/;

            a=mou(a,a);

        }

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

        {

            ans=mou(s,ans);

            s=mou(s,s);

        }

        printf("%d\n",ans.z[][]);

    }

    return  ;

}