#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

void solve()
{
  int n, k, x;
  cin >> n >> k >> x;
  vector<int> h(n), cnt(n);
  for (int i = 0; i < n; ++i) cin >> h[i];
  int lid = 0, rid = n - 1;
  for (int i = 0; (i + 1) * k < n; ++i)
  {
    int s = i * k, flag = 1;
    for (int j = 0; j < k; ++j)
    {
      if (h[s + j] != h[s])
      {
        flag = 0;
        break;
      }
    }
    if (flag) lid = (i + 1) * k;
    else break;
  }
  for (int i = 0; (i + 1) * k < n; ++i)
  {
    int s = n - 1 - i * k, flag = 1;
    for (int j = 0; j < k; ++j)
    {
      if (h[s - j] != h[s])
      {
        flag = 0;
        break;
      }
    }
    if (flag) rid = s - k;
    else break;
  }
  if (lid > rid)
  {
    cout << "Yes" << endl;
    return;
  }
  if (rid - lid + 1 < k)
  {
    cout << "No" << endl;
    return;
  }
  int mi = 1e9;
  for (int i = lid; i <= rid; ++i) mi = min(mi, h[i]);
  for (int i = 0; i < k - 1; ++i)
  {
    if (h[lid + i] < h[lid + i + 1])
    {
      cout << "No" << endl;
      return;
    }
  }
  for (int i = 0; i < k - 1; ++i)
  {
    if (h[rid - i] < h[rid - i - 1])
    {
      cout << "No" << endl;
      return;
    }
  }
  long long sum = 0;
  for (int i = 0; i < n; ++i)
  {
    int d = h[i] - mi;
    if (d % x)
    {
      cout << "No" << endl;
      return;
    }
    sum += (h[i] - mi) / x;
  }
  int g = __gcd(n, k);
  cout << (sum % g ? "No" : "Yes") << endl;
}

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