1 //2218MS    8136K    1668 B    G++    
 2 #include<iostream>
 3 #include<map>
 4 #include<algorithm>
 5 #define M 1000000007
 6 #define N 500005
 7 #define ll __int64
 8 using namespace std;
 9 int c[N],a[N],t[N],s[N];
10 int cnt;
11 inline int lowbit(int k)
12 {
13     return (-k)&k;
14 }
15 inline void update(int k,int detal)
16 {
17     for(int i=k;i<=cnt;i+=lowbit(i)){
18         c[i]+=detal;
19         if(c[i]>=M) c[i]%=M;
20     }
21 }
22 inline int getsum(int k)
23 {
24     int s=0;
25     for(int i=k;i>0;i-=lowbit(i)){
26         s+=c[i];
27         if(s>=M) s%=M;
28     }
29     return s;
30 }
31 inline int search(int a0[],int m)
32 {
33     int l=1,r=cnt,mid;
34     while(l<r){
35         mid=(l+r)>>1;
36         if(a0[mid]<m) l=mid+1;
37         else r=mid;
38     }
39     return l;
40 }
41 int main(void)
42 {
43     int cas,n,m,k=1;
44     ll x,y,z;
45     scanf("%d",&cas);
46     while(cas--)
47     {
48         memset(c,0,sizeof(c));
49         scanf("%d%d%I64d%I64d%I64d",&n,&m,&x,&y,&z);
50         for(int i=0;i<m;i++)
51             scanf("%d",&a[i]);
52         for(int i=0;i<n;i++){
53             s[i]=a[i%m];
54             t[i]=s[i];
55             a[i%m]=(x*a[i%m]+y*(i+1))%z;
56         }   
57         sort(t,t+n);
58         cnt=0;
59         //map<int,int>Map;
60         //Map[t[0]]=++cnt;
61         a[++cnt]=t[0];
62         for(int i=1;i<n;i++){
63             if(t[i]!=t[i-1]){
64                 //Map[t[i]]=++cnt;
65                 a[++cnt]=t[i];
66             }
67         }
68         ll ans=0;
69         update(1,1);
70         for(int i=0;i<n;i++){
71             int id=search(a,s[i]); //离散化的二分查找 
72             int temp=getsum(id); 
73             ans+=temp; //dp思想 
74             if(ans>=M) ans%=M;
75             update(id+1,temp);
76         }
77         printf("Case #%d: %I64d\n",k++,ans);
78     }
79     return 0;
80 }