<https://www.nowcoder.com/acm/contest/205/B>

64bit IO Format: %lld

a0,a1,m0,m1,c< M, 2≤ k≤ 106，保证M为奇数。 保证。

1 1 1 1 1 0 1000000007 10

904493530 #include <stdio.h> #include<vector> #include<utility> #include
<assert.h> using namespace std; #define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--) #define pb push_back #define mp
make_pair #define all(x) (x).begin(),(x).end() #define fi first #define se
second #define SZ(x) ((int)(x).size()) typedef vector<int> VI; typedef long
long ll; typedef pair<int,int> PII; const ll mod=1000000007; ll gcd(ll a,ll b)
{ return b?gcd(b,a%b):a;} // head typedef unsigned long long u64; typedef
__int128_t i128; typedef __uint128_t u128; int _,k; u64 A0,A1,M0,M1,C,M; struct
Mod64 { Mod64():n_(0) {} Mod64(u64 n):n_(init(n)) {} static u64 init(u64 w) {
return reduce(u128(w) * r2); } static void set_mod(u64 m) { mod=m;
assert(mod&1); inv=m; rep(i,0,5) inv*=2-inv*m; r2=-u128(m)%m; } static u64
reduce(u128 x) { u64 y=u64(x>>64)-u64((u128(u64(x)*inv)*mod)>>64); return
ll(y)<0?y+mod:y; } Mod64& operator += (Mod64 rhs) { n_+=rhs.n_-mod; if
(ll(n_)<0) n_+=mod; return *this; } Mod64 operator + (Mod64 rhs) const { return
Mod64(*this)+=rhs; } Mod64& operator -= (Mod64 rhs) { n_-=rhs.n_; if (ll(n_)<0)
n_+=mod; return *this; } Mod64 operator - (Mod64 rhs) const { return
Mod64(*this)-=rhs; } Mod64& operator *= (Mod64 rhs) {
n_=reduce(u128(n_)*rhs.n_); return *this; } Mod64 operator * (Mod64 rhs) const
{ return Mod64(*this)*=rhs; } u64 get() const { return reduce(n_); } static u64
mod,inv,r2; u64 n_; }; u64 Mod64::mod,Mod64::inv,Mod64::r2; int main() { for
(scanf("%d",&_);_;_--) {
scanf("%llu%llu%llu%llu%llu%llu%d",&A0,&A1,&M0,&M1,&C,&M,&k);
Mod64::set_mod(M); Mod64 a0(A0),a1(A1),m0(M0),m1(M1),c(C),ans(1),a2(0); for
(int i=0;i<=k;i++) { ans=ans*a0; a2=m0*a1+m1*a0+c; a0=a1; a1=a2; }
printf("%llu\n",ans.get()); } }