MZL's xor

MZL loves xor very much.Now he gets an array A.The length of A is n.He wants to know the xor of all (A_i+A_j)(1<= i,j <= n)
The xor of an array B is defined as B₁ xor B₂...xor B_n

Multiple test cases, the first line contains an integer T(no more than 20), indicating the number of cases.
Each test case contains four integers:n,m,z,l
A₁=0,A_i=(A_i−1∗m+z) mod l
1≤m,z,l≤5∗10⁵,n=5∗10⁵

For every test.print the answer.