#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<long long>a(n);
		rep(i, n)cin >> a[i];
		bool chk = true;
		{
			int r = a[0] % x;
			rep(i, n) {
				if (0 != (a[i] - r) % x)chk = false;
				a[i] = (a[i] - r) / x;
			}
		}
		vector<long long>d(n + 1);
		rep(i, n - 1)d[i + 1] = a[i + 1] - a[i];
		//d[0] = a[0], d[n] = -a[n - 1];
		rep(i, k) {
			// *????*
			if (0 == i && i == n % k) {
				continue;
			}
			// *????_
			else if (0 == i) {
				long long sum = 0;
				for (int j = i; j <= n; j += k) sum += d[j];
				d[0] = -sum;
				sum = 0;
				for (int j = i; j <= n; j += k) {
					sum += d[j];
					if (sum > 0)chk = false;
				}
			}
			// _????*
			else if (i == n % k) {
				long long sum = 0;
				for (int j = i; j <= n; j += k) sum += d[j];
				d[n] = -sum;
				sum = 0;
				for (int j = i; j <= n; j += k) {
					sum += d[j];
					if (sum > 0)chk = false;
				}

			}
			// _????_
			else {
				long long sum = 0;
				for (int j = i; j <= n; j += k) {
					sum += d[j];
					if (sum > 0)chk = false;
				}
				if (0 != sum)chk = false;
			}
		}
		cout << (chk ? "Yes" : "No") << endl;
	}
	return 0;
}