#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

bool solve() {
  int n, k, x;
  cin >> n >> k >> x;
  VI h(n);
  rep(i, n) cin >> h[i];
  {
    int r = h[0] % x;
    rep(i, n) {
      if (h[i] % x != r) return false;
      h[i] = (h[i] - r) / x;
    }
  }
  VL d(n + 1);
  rep(i, n - 1) d[i+1] = h[i+1] - h[i];
  d[0] = h[0], d[n] = -h[n-1];
  rep(r, k) {
    if (r == 0) {
      if (n % k == 0) continue;
      for (int i = n / k * k; i >= k; i -= k) {
        if (d[i] < 0) return false;
        d[i - k] += d[i];
      }
    } else {
      for (int i = r; i <= n; i += k) {
        if (i + k > n) {
          if (i < n && d[i] != 0) return false;
        } else {
          if (d[i] > 0) return false;
          d[i+k] += d[i];
        }
      }
    }
  }
  return true;
}

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while (tt--) {
    cout << (solve() ? "Yes\n" : "No\n");
  }
}