#include <bits/stdc++.h>

using namespace std;

ifstream fin ("sate2.in");
ofstream fout ("sate2.out");

const int bulaneala = 1000000;
int t, n, m, k, a[3002];
set<int>G[4];
int sum[4];

void reset () {
  for (int i = 0; i < 4; i++) {
    G[i].clear();
    sum[i] = 0;
  }
}

int main()
{
    srand(time(NULL));
  fin >> t;
  while (t--) {
    fin >> n >> m >> k;
    int mx = 0;
    for (int i = 1; i <= n; i++) {
      fin >> a[i];
      mx = max(mx, a[i]);
      int x = rand() % k;
      G[x].insert(a[i]);
      sum[x] += a[i];
    }
    if (m % k != 0 || mx > m / k) {
      fout << "NU\n";
      reset();
      continue;
    }
    bool ok = 0;
    for (int soarta = 1; soarta <= bulaneala; soarta++) {
      int mx = 0, poz1 = 0;
      for (int j = 0; j < k; j++)
        if (sum[j] > mx) {
          poz1 = j;
          mx = sum[j];
        }
      int mn = 1e9, poz2 = 0;
      for (int j = 0; j < k; j++)
        if (sum[j] < mn) {
          poz2 = j;
          mn = sum[j];
        }
      if (mn == m / k) {
        fout << "DA\n";
        ok = 1;
        break;
      }
      int lol = rand () % (m / k - sum[poz2]) + 1;
      auto it = G[poz1].lower_bound(lol);
      if (it == G[poz1].end())
        continue;
      sum[poz1] -= *it;
      sum[poz2] += *it;
      G[poz2].insert(*it);
      G[poz1].erase(it);
    }
    reset();
    if (!ok)
      fout << "NU\n";
  }
  return 0;
}