RT.我实在找不出错了

#include <bits/stdc++.h>
using namespace std;
namespace Main
{
	typedef long long ll;
	ll n,m,a,c,x0,g;
	struct Matrix
	{
		ll imap[2][2];
		Matrix()
		{
			memset(imap,0,sizeof(imap));
		}
		void init()
		{
			imap[0][0]=imap[1][1]=1;
		}
		ll guisucheng(ll a,ll b)
		{
			ll res=0;
			while(b)
			{
				if(b&1)res=(res+a)%m;
				a=a*2%m;
				b>>=1;
			}
			return res;
		}
		Matrix operator*(Matrix b)
		{
			Matrix res;
			for(int i=0;i<2;i++)
			{
				for(int j=0;j<2;j++)
				{
					for(int k=0;k<2;k++)
					{
						res.imap[i][j]+=guisucheng(imap[i][k],b.imap[k][j]);
						res.imap[i][j]%=m;
					}
				}
			}
			return res;
		}
	};
	Matrix ksm(Matrix base,ll b)
	{
		Matrix res;
		res.init();
		while(b)
		{
			if(b&1)res=res*base;
			base=base*base;
			b>>=1;
		}
		return res;
	}
	void main()
	{
		Matrix A,B;
		scanf("%lld%lld%lld%lld%lld%lld",&m,&a,&c,&x0,&n,&g);
		A.imap[0][0]=a;
		A.imap[0][1]=A.imap[1][1]=1;
		B.imap[0][0]=x0;
		B.imap[0][1]=c;
		Matrix ans=B*ksm(A,n);
		printf("%lld",ans.imap[0][0]%g);
	}
}
int main()
{
	Main::main();
	return 0;
}