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

using ll = long long;

void solve() {
  int N, K;
  ll X;
  cin >> N >> K >> X;
  vector<ll> H(N), d(N);
  for(int i = 0; i < N; i++) {
    cin >> H[i];
  }
  for(int i = 1; i < N; i++) {
    d[i] = H[i] - H[i - 1];
  }
  string ans = "Yes";
  for(int r = 0; r < K; r++) {
    if(r == 0 || r == N % K) {
      for(int m = 0; r + K * m < N; m++) {
        ll hm = (d[r + K * m] % X + X * 1000000000) % X;
        if(hm != 0) ans = "No";
      }
    }else {
      for(int m = 0; r + K * m < N; m++) {
        ll hm = (d[r + K * m] % X + X * 1000000000) % X;
        if(hm != 0) ans = "No";
        else if(d[r + K * m] > 0) ans = "No";
        else if(r + K * (m + 1) < N) d[r + K * (m + 1)] += d[r + K * m];
      }
    }
    // cout << r << " : " << ans << "\n";
  }
  cout << ans << "\n";
}

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