#include <bits/stdc++.h>
using namespace std;

const long long INF = 1LL << 60;

void solve(){
    int n, k;
    long long x;
    cin >> n >> k >> x;
    vector<long long> h(n);
    for(int i = 0; i < n; i++){
        cin >> h[i];
    }

    vector<vector<long long>> d(k);
    vector<long long> sum(k);
    for(int i = 0; i <= n; i++){
        if(i == 0 || i == n){
            d[i % k].push_back(INF);
        }else{
            d[i % k].push_back(h[i] - h[i - 1]);
            sum[i % k] += h[i] - h[i - 1];
        }
    }

    int m = h[0] % x;
    for(int i = 1; i < n; i++){
        if(h[i] % x != m){
            cout << "No" << "\n";
            return;
        }
    }

    for(int i = 0; i < k; i++){
        if(d[i][0] == INF && d[i].back() == INF){
            continue;
        }
        if(sum[i] != 0){
            if(d[i][0] == INF && (int) d[i].size() >= 2){
                if(sum[i] > 0){
                    d[i][1] += -sum[i];
                }else{
                    cout << "No" << "\n";
                    return;
                }
            }else if(d[i].back() == INF && (int) d[i].size() >= 2){
                if(sum[i] < 0){
                    d[i][d[i].size() - 2] += -sum[i];
                }else{
                    cout << "No" << "\n";
                    return;
                }
            }else{
                cout << "No" << "\n";
                return;
            }
        }
        long long cs = 0;
        for(auto v : d[i]){
            if(v == INF){
                continue;
            }
            cs += v;
            if(cs > 0){
                cout << "No" << "\n";
                return;
            }
        }
    }

    cout << "Yes" << "\n";
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T; cin >> T;
    while(T--){
        solve();
    }
}