#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+5;
int n,D,now,cnt,Case,fa[N],h[N],S[N];
bool ok[N],vis[N];
struct node{int x,d;}a[N];
struct edge{int n,t;}e[N];
void add(int x,int y){e[++cnt]={h[x],y},h[x]=cnt;}
void dfs1(int x){ok[x]=1,now++;for(int i=h[x];i;i=e[i].n)if(vis[e[i].t])dfs1(e[i].t);}
void dfs2(int x){ok[x]=0,now--;for(int i=h[x];i;i=e[i].n)if(ok[e[i].t])dfs2(e[i].t);}
void Add(int x){vis[x]=1;if(x==1||ok[fa[x]])dfs1(x);}
void Del(int x){vis[x]=0;if(ok[x])dfs2(x);}
//int find(int x,int k) {
//	if(S[x]<k||S[x]>k+D)return 0;
//	int res=1;
//	for(int i=h[x];i;i=e[i].n)res+=find(e[i].t,k);
//	return res;
//}
void solve() {
	int as,cs,rs,am,cm,rm;a[1].x=1,now=cnt=0,memset(h,0,sizeof(h));
	scanf("%d%d%d%d%d%d%d%d%d%d",&n,&D,&a[1].d,&as,&cs,&rs,fa+1,&am,&cm,&rm),S[1]=a[1].d;
	for(int i=2;i<=n;i++)a[i]={i,(int)(1ll*a[i-1].d*as+cs)%rs},fa[i]=(1ll*fa[i-1]*am+cm)%rm,S[i]=a[i].d;
	for(int i=2;i<=n;i++)fa[i]=fa[i]%(i-1)+1,add(fa[i],i);fa[1]=0;
	sort(a+1,a+n+1,[](const node &x,const node &y){return x.d<y.d;});
	int j=0,ans=0;
	for(int i=1;i<=n;i++) {
		while(j<n&&a[j+1].d<=a[i].d+D)Add(a[++j].x);
		ans=max(ans,now),Del(a[i].x);
	}
	printf("Case #%d: %d\n",++Case,ans);
}
int main() {
	int tt;scanf("%d",&tt);
	while(tt--)solve();
	return 0;
}