import sys

sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

def ok():
    n, k, x = LI()
    hh = LI()
    dd = [0]*n
    for i in range(n-1):
        dd[i+1] = hh[i+1]-hh[i]
    for d in dd:
        if d%x: return False
    for si in range(k):
        if si==0 or si==n%k:continue
        s=sum(dd[i] for i in range(si,n,k))
        if s:return False
    for si in range(n-1, n-1-k, -1):
        if si%k == n%k:
            if si%k == 0:
                dd[si] += x*10**9
            else:
                s = sum(dd[i] for i in range(si, 0, -k))
                dd[si] -= s
        for i in range(si, k-1, -k):
            if dd[i] < 0: return False
            dd[i-k] += dd[i]
        i = si%k
        if i and dd[i] != 0: return False
    return True

for _ in range(II()): print("Yes" if ok() else "No")