1 //Author: xiaowuga
 2 #include <iostream>
 3 #include <algorithm>
 4 #include <set>
 5 #include <vector>
 6 #include <queue>
 7 #include <cmath>
 8 #include <cstring>
 9 #include <cstdio>
10 #include <ctime>
11 #include <map>
12 #include <bitset>
13 #include <cctype>
14 #define maxx INT_MAX
15 #define minn INT_MIN
16 #define inf 0x3f3f3f3f
17 #define mem(s,ch) memset(s,ch,sizeof(s))
18 #define da cout<<da<<endl
19 #define uoutput(a,i,l,r) for(int i=l;i<r;i++) if(i==l) cout<<a[i];else cout<<" "<<a[i];cout<<endl;
20 #define doutput(a,i,l,r) for(int i=r-1;i>=0;i--) if(i==r-1) cout<<a[i];else cout<<" "<<a[i];cout<<endl;
21 const long long N=1e7+10;
22 using namespace std;
23 typedef long long LL;
24 unsigned x,y,z;
25 unsigned rng61() {
26   unsigned t;
27   x ^= x << 16;
28   x ^= x >> 5;
29   x ^= x << 1;
30   t = x;
31   x = y;
32   y = z;
33   z = t ^ x ^ y;
34   return z;
35 }
36 unsigned num[N];
37 unsigned ans[N],ca=0;
38 pair<int,int>q[100+10];
39 int cmp(pair<int,int>a,pair<int,int>b){
40     return a.first<b.first;
41 }
42 int main() {
43     ios::sync_with_stdio(false);cin.tie(0);
44     unsigned n,m;
45     while(cin>>n>>m>>x>>y>>z){
46         for(int i=0;i<n;i++) num[i]=rng61();
47         for(int i=0;i<m;i++) {cin>>q[i].first;q[i].second=i;}
48         sort(q,q+m,cmp);//从小到大排序
49         q[m].first=n;
50         q[m].second=m;
51         for(int i=m-1;i>=0;i--){
52             //我们知道q[i+1].f是大于q[i].f的所以我们根据这个性质
53             //我们每次在[0,q[i+1].f)这个区间里面去找第q[i].f+1大的的数
54             //我们还需要知道nth_element这个函数是把第n+1大的数放在n的下标里面
55             nth_element(num,num+q[i].first,num+q[i+1].first);
56             ans[q[i].second]=num[q[i].first];
57         }
58         cout<<"Case #"<<++ca<<":";
59         for(int i=0;i<m;i++) cout<<" "<<ans[i];
60         cout<<endl;
61     }
62     return 0;
63 }