1 #include<bits/stdc++.h>
 2 using namespace std;
 3 #define LL long long 
 4 #define inf 0x3f3f3f3f
 5 #define pb push_back
 6 #define pii pair<int,int>
 7 deque<int>q;
 8 int a[10000010];
 9 int main(){
10   LL n,i,j,k,m,P,Q,R,t,MOD;
11   scanf("%d",&t);
12   while(t--){
13     scanf("%lld%lld%lld%lld%lld%lld%lld",&n,&m,&k,&P,&Q,&R,&MOD);
14     q.clear();
15     for(i=1;i<=k;++i) scanf("%d",a+i);
16     for(i=k+1;i<=n;++i)a[i]=(P*a[i-1]+Q*i+R)%MOD;
17     LL ans1=0,ans2=0;
18     for(i=n;i>=1;--i){
19       while(!q.empty()&&a[i]>=a[q.back()])q.pop_back();
20       while(!q.empty()&&q.front()>i+m-1) q.pop_front();
21       q.push_back(i);
22       if(i>n-m+1) continue;
23       ans1+=(a[q.front()]^i);
24       ans2+=(q.size()^i);
25     }
26     cout<<ans1<<‘ ‘<<ans2<<endl;
27   }
28   return 0;
29 }