#include <bits/stdc++.h>
using namespace std;
const long double pi = acos(-1);
const long long int mod = 1e9 + 7;
bool sortbysec(pair<long long int, long long int> a,
               pair<long long int, long long int> b) {
  return (a.second < b.second);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long int t, n, i, j, k, len, x, y, z, c, f, flag, p, q, mx, mn, l, r,
      sum, ans, tmp, it, pos, avg, m, cnt;
  string s;
  char ch;
  vector<long long int> v;
  vector<pair<long long int, long long int>> vec;
  unordered_map<long long int, long long int> mappu;
  pair<long long int, long long int> pr;
  t = 1;
  cin >> t;
  while (t--) {
    f = 0;
    sum = 0;
    flag = 0;
    ans = 0;
    cnt = 0;
    v.clear();
    mappu.clear();
    vec.clear();
    cin >> n >> k;
    long long int a[n];
    priority_queue<long long int, vector<long long int>> pq;
    for (i = 0; i < n; i++) {
      cin >> tmp;
      a[i] = tmp;
      if (tmp) pq.push(tmp);
    }
    x = 1;
    while (x * k <= 1e17) x *= k;
    while (pq.size() && x >= 1) {
      tmp = pq.top();
      pq.pop();
      if (tmp >= x) {
        tmp -= x;
      }
      if (tmp) pq.push(tmp);
      x /= k;
    }
    priority_queue<long long int, vector<long long int>> pp = pq;
    if (pq.size() == 0)
      cout << "YES"
           << "\n";
    else
      cout << "NO"
           << "\n";
  }
  return 0;
}
