#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(),(v).end()
#define pb(a) push_back(a)
#define rep(i, n) for(int i=0;i<n;i++)
#define foa(e, v) for(auto& e : v)
using ll = long long;
const ll MOD7 = 1000000007, MOD998 = 998244353, INF = (1LL << 60);
#define dout(a) cout<<fixed<<setprecision(10)<<a<<endl;

void solve() {
    ll n, k, x; cin >> n >> k >> x;
    vector<ll> a(n), b(n + 1, 0);
    rep(i, n) cin >> a[i];
    rep(i, n - 1) b[i + 1] = a[i + 1] - a[i];
    bool ng = 0;
    foa(e, b) if(e % x) ng = 1;
    if(ng) {
        cout << "No" << endl;
        return;
    }
    rep(i, k) {
        if(i == 0) {
            if(n % k == i) {
                continue;
            } else {
                ll sum = 0;
                for(int j = i; j < n; j += k) {
                    sum += b[j];
                    if(sum > 0) {
                        sum = 0;
                    }
                }
                if(sum < 0) ng = true;
            }
        } else {
            if(n % k == i) {
                ll sum = 0;
                for(int j = i; j < n; j += k) {
                    sum += b[j];
                    if(sum > 0) {
                        ng = true;
                        break;
                    }
                }
                if(sum > 0) ng = true;
            } else {
                ll sum = 0;
                for(int j = i; j < n; j += k) {
                    sum += b[j];
                    if(sum > 0) {
                        ng = true;
                        break;
                    }
                }
                if(sum) ng = true;
            }
        }
    }
    cout << (ng ? "No" : "Yes") << endl;
}
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t;
    cin >> t;
    while(t --) solve();
    return 0;
}