#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		int n, k, x; cin >> n >> k >> x;
		vector<vector<int>>d(k);
		rep(i, n) {
			int h; cin >> h;
			d[i%k].push_back(h);
		}
		map<int, set<int>>mp;
		bool chk = true;
		rep(i, k) {
			int sz = d[i].size();
			sort(all(d[i]));
			long long sum = 0;
			rep(j, sz) {
				int diff = d[i][sz - 1] - d[i][j];
				if (diff%x != 0)chk = false;
				sum += d[i][j];
			}
			mp[sz].insert(sum);
			//cout << sz << " " << sum << endl;
		}
		for (auto[k, v] : mp) {
			if (1 != v.size())chk = false;
		}
		cout << (chk ? "Yes" : "No") << endl;
	}
	return 0;
}