#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
namespace IO{int c;unsigned int seed;unsigned int randnum(){seed^=seed<<13;seed^=seed>>17;seed^=seed<<5;return seed;}inline int read(int &x){scanf("%d",&x);return x;}inline void init_case(int &m,int &a,int &b,int &d,int p[]){scanf("%d%u%d%d%d%d",&m,&seed,&a,&b,&c,&d);for(int i=1;i<=m;i++){if(randnum()%c==0)p[i]=-1;else p[i]=randnum()%b;}}inline void update_ans(unsigned int &ans_sum,unsigned int cur_ans,int no){const static unsigned int mod=998244353;ans_sum^=(long long)no*(no+7)%mod*cur_ans%mod;}
}
using IO::read;
using IO::init_case;
using IO::update_ans;
const int maxn=2000010;
int p[maxn];
bool A[maxn],B[maxn];
int q[maxn],head,tail;
queue<int>Q;
void ins(int x){while(head<tail&&q[tail-1]>x)tail--;q[tail++]=x;
}
int main(){int T;read(T);int m,a,b,d;while(T--){unsigned int ans_sum=0,cur_ans=0;init_case(m,a,b,d,p);memset(A,0,sizeof(A));memset(B,0,sizeof(B));head=0;tail=0;for(int i=0;i<=a;i++)A[i]=B[i]=1;while(!Q.empty())Q.pop();int ans=a+1,maxs=a;for(int i=1;i<=m;i++){bool ok=1;if(p[i]==-1){if(Q.empty()||d)ok=0;else{int x=Q.front();A[x]=1;Q.pop();if(head<tail&&q[head]==x)head++;if(head<tail)ans=min(maxs+1,q[head]);else ans=maxs+1;}}else if(!B[p[i]]){A[p[i]]=B[p[i]]=1;while(B[maxs+1]){if(ans==maxs+1)ans++;maxs++;}if(head<tail&&maxs+1>=q[head])ans=q[head];}else if(A[p[i]]){if(d)ok=0;else{Q.push(p[i]);A[p[i]]=0;ins(p[i]);ans=min(ans,q[head]);}}else{if(Q.empty()||d)ok=0;else{int x=Q.front();A[x]=1;Q.pop();if(head<tail&&q[head]==x)head++;if(head<tail)ans=min(maxs+1,q[head]);else ans=maxs+1;}}if(!ok)cur_ans=0;else cur_ans=ans;update_ans(ans_sum,cur_ans,i);}printf("%u\n",ans_sum);}return 0;
}