#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using i3 = pair<int, ii>;
using li = pair<ll, int>;
using lii = pair<ll, ii>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<ii>;
using vli = vector<li>;
using vpll = vector<pll>;
using vi3 = vector<i3>;
using vlii = vector<lii>;
const int N = 2e5 + 5;
const ll INF = 1e17 + 7;
const double eps = 1e-9, PI = acos(-1);
int n, k;
void solve(int testCase) {
  scanf("%d %d", &n, &k);
  vl val;
  ll mul = 1;
  val.push_back(1);
  for (int i = 1;; i++) {
    mul *= 1ll * k;
    if (mul > ll(1e16)) break;
    val.push_back(mul);
  }
  int sz = val.size();
  vector<bool> vis(sz + 1, 0);
  bool sol = 1;
  for (int i = 0; i < n; i++) {
    ll x;
    scanf("%lld", &x);
    if (x == 0) continue;
    for (int j = sz - 1; j >= 0; j--) {
      if (!vis[j] && (val[j] <= x)) {
        x -= val[j];
        vis[j] = 1;
      }
    }
    if (x != 0) sol = 0;
  }
  printf("%s\n", sol ? "YES" : "NO");
}
int main() {
  int t = 1;
  scanf("%d", &t);
  for (int testCase = 1; testCase <= t; testCase++) {
    solve(testCase);
  }
  return 0;
}
