#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include <ctime>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<cmath>
#define mst(ss,b) memset((ss),(b),sizeof(ss))
#define maxn 0x3f3f3f3f
///#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
#define INF (1ll<<60)-1
using namespace std;
int n;
int a[50010],tr[200010],anw[50010];
void build(int root,int l,int r){if(l==r){tr[root]=1;return ;}int mid=(l+r)>>1;build(root*2,l,mid);build(root*2+1,mid+1,r);tr[root]=tr[root*2]+tr[root*2+1];
}
int query(int root,int l,int r,int k){if(l==r){return l;}int mid=(l+r)>>1;if(tr[root*2]>=k) return query(root*2,l,mid,k);else return query(root*2+1,mid+1,r,k-tr[root*2]);
}
void update(int pos,int v,int root,int l,int r){if(l==r){tr[root]=v;return ;}int mid=(l+r)>>1;if(pos>mid) update(pos,v,root*2+1,mid+1,r);else update(pos,v,root*2,l,mid);tr[root]=tr[root*2]+tr[root*2+1];
}
int main(){int T;scanf("%d",&T);while(T--){mst(a,0);mst(anw,0);scanf("%d",&n);build(1,1,n);for(int i=1;i<=n;i++) scanf("%d",&a[i]);for(int i=n;i>=1;i--){int x=a[i]-a[i-1];anw[i]=query(1,1,n,i-x);update(anw[i],0,1,1,n);}for(int i=1;i<=n;i++){if(i==1) printf("%d",anw[i]);else printf(" %d",anw[i]);}printf("\n");}return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include <ctime>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<cmath>
#define mst(ss,b) memset((ss),(b),sizeof(ss))
#define inf 0x3f3f3f3f
#define MAX 500010
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
#define INF (1ll<<60)-1
using namespace std;
int n,k,A,B,tot;
int head[MAX];
struct node{int to,next;
}edge[MAX];
void add(int u,int v){edge[tot].to=v; /// 当前边 u->vedge[tot].next=head[u]; /// 连接 u 节点的上一条边head[u]=tot++;
}
int son[MAX][15],pre[MAX][15],anw[MAX];
void init(){mst(head,-1); mst(son,0); mst(pre,0); mst(anw,0);tot=0;
}
void DFS(int x){son[x][0]=1;for(int i=head[x];i!=-1;i=edge[i].next){int v=edge[i].to;DFS(v);for(int j=1;j<=k;j++) son[x][j]+=son[v][j-1];}
}
void DFS1(int x){///pre[x][0]=1;for(int i=0;i<=k;i++) anw[x]+=(son[x][i]+pre[x][i]);for(int i=head[x];i!=-1;i=edge[i].next){int v=edge[i].to;for(int j=1;j<13;j++) pre[v][j]+=(pre[x][j-1]);pre[v][1]++;for(int j=2;j<13;j++) pre[v][j]+=(son[x][j-1]-son[v][j-2]);DFS1(v);}
}
int main(){int T;scanf("%d",&T);while(T--){init();scanf("%d%d%d%d",&n,&k,&A,&B);for(int i=2;i<=n;i++){ll w=((ll)A*i+B)%(i-1)+1;add((int)w,i);}DFS(1);DFS1(1);/*for(ll i=1;i<=n;i++) cout<<son[i][k]<<" ";cout<<endl;for(ll i=1;i<=n;i++){for(ll j=0;j<=k;j++){cout<<pre[i][j]<<" ";}cout<<endl;}*/int ans=0;for(int i=1;i<=n;i++) ans^=anw[i];printf("%d\n",ans);}return 0;
}