#include<bits/stdc++.h>
using namespace std;
long long n,m,a,b,c;
int power(int a,int b,int m){
    int ans=1;
    while(n){
        if(n&1)ans=a*ans%m;
        a=a*a%m;
        n>>=1;
    }
    return ans;
}
int main(){
	cin>>n>>m>>a>>b>>c;
	//printf("%d %d %d %d %d %d\n",n,m,a,b,c,power(a,b,n));
    cout<<(c+1ll*m*power(a,b,n)%n+n+1)%n;
}

本人垃圾快速幂代码 神奇RE