#include<cstdio>

using namespace std;

#define ll long long

const int M = 1e7+;

ll  a[M],p,q,r,mod;

ll  n,m,k;

ll  lis[M],head,tail,t;

int main()

{

    scanf("%lld",&t);

    while(t--){

        scanf("%lld%lld%lld%lld%lld%lld%lld",&n,&m,&k,&p,&q,&r,&mod);

        for(int i = ;i <= k;i ++)

            scanf("%lld",&a[i]);

        for(int i = k + ;i <= n;i ++)

            a[i] = ((p * a[i - ]) % mod + q * i % mod + r) % mod;

        head = tail = ;

        for(int i = n;i >= n-m+;i --){

            while(head < tail&&a[lis[tail-]] <= a[i]) -- tail;

            lis[tail++] = i;

       }

       ll A = ,B = ;

       A += a[lis[head]] ^ (n-m+);

       B += (tail - head) ^ (n - m + );

       for(int i = n-m;i >= ;i --){

           while(lis[head] > i + m - &&head < tail) ++head;

           while(head < tail&&a[lis[tail - ]] <= a[i]) --tail;

           lis[tail++] = i;

           A += a[lis[head]] ^ i;

           B += (tail - head) ^ i;

       }

       printf("%lld %lld\n",A,B);

    }

    return ;

}