# divide (a[0] + a[1] * x + ... + a[n-1] * x^(n-1)) by (1 + x + ... + x^(k-1))
def flat_division(n, a, k):
	b = [0] * (n+1)
	for i in range(n):
		b[i] -= a[i]
		b[i+1] += a[i]
	c = [0] * (n-k+1)
	for i in range(n-k, -1, -1):
		c[i] = b[i+k]
		b[i] -= b[i+k]
		b[i+k] = 0
	return c

def solve(n, k, a):
	v = [0] * k
	for i in range(n):
		v[i%k] += a[i]
	if n % k == 0:
		if v != [v[0]] * k:
			return False
		b = flat_division(n, a, k)
		return all(i % k == 0 or b[i] <= 0 for i in range(n-k+1))
	else:
		x = v[0] - v[-1]
		for i in range(k):
			if v[i] != (v[0] if i < n % k else v[-1]):
				return False
		for i in range(n):
			a[i] -= x
		b = flat_division(n, a, k)
		return all(b[i] <= 0 for i in range(n-k+1))

T = int(input())
for _ in range(T):
	n, k, x = map(int, input().split())
	h = list(map(int, input().split()))
	if not all(h[i] % x == h[0] % x for i in range(n)):
		print('No')
	else:
		for i in range(n):
			h[i] //= x
		print('Yes' if solve(n, k, h) else 'No')