def solve():
    n, k, x = map(int, input().split())
    H = list(map(int, input().split()))
    if len(set(h % x for h in H)) != 1:
        print("No")
        return
    H = [h // x for h in H]
    tot = [0] * k
    ma = max(H)
    for i, h in enumerate(H):
        tot[i % k] += ma - h

    bef = tot[: n % k]
    aft = tot[n % k :]
    if bef and len(set(bef)) != 1:
        print("No")
        return
    if aft and len(set(aft)) != 1:
        print("No")
        return

    if bef and aft:
        b = bef[0]
        a = aft[0]
        d = a - b
        if d < 0:
            print("No")
            return

        goal = ma + d
        R = [goal - h for h in H]
        minus = [0] * n
        tot = 0
        for i in range(n):
            tot -= minus[i]
            r = R[i] - tot
            if r < 0:
                print("No")
                return
            tot += r
            if i + k < n:
                minus[i + k] = r

    else:
        goal = 1 << 30
        R = [goal - h for h in H]
        minus = [0] * n
        tot = 0
        for i in range(n):
            tot -= minus[i]
            r = R[i] - tot
            if r < 0:
                print("No")
                return
            tot += r
            if i + k < n:
                minus[i + k] = r

    print("Yes")


for _ in range(int(input())):
    solve()