#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 1000000000000000001

int main(){
	int _t;
	cin>>_t;
	rep(_,_t){
		long long N,K,X;
		cin>>N>>K>>X;
		vector<long long> h(N);
		rep(i,N)cin>>h[i];
		vector<long long> d(h[0]);
		rep(i,N-1){
			d.push_back(h[i+1]-h[i]);
		}
		d.push_back(-h[N-1]);
		bool f=  true;
		rep(i,K){
			bool F = false;
			long long sum = 0;
			set<long long> s;
			for(int j=i;j<=N;j+=K){
				if(j==0 || j==N){
					F = true;
					continue;
				}
				sum += d[j];
				{
					long long dd = d[j];
					dd %= X;
					if(dd<0)dd+=X;
					s.insert(dd);
					if(s.size()>=2){
						f= false;
						break;
					}
				}
			}
			if(!f)break;
			if(!F && sum!=0){
				f = false;
				break;
			}
		}
		if(f)cout<<"Yes"<<endl;
		else cout<<"No"<<endl;
	}
    return 0;
}