#include <iostream>
#include<vector>
#include<fstream>
#include<utility>
#include<algorithm>
#include <deque>
#include <queue>
#include <ctime>
#include <cstdlib>

using namespace std;

int N, M, K;
vector <int> values;

void Solve() {
	values.clear();
	
	 scanf("%d %d %d", &N, &M, &K);
	 
	 int i, vmax = 0;
	 
	 values.resize(N);

	 for (i = 0; i < N; ++i) {
		 scanf("%d", &values[i]);
		 vmax = max(vmax, values[i]);
	 }
	 
	 if (M % K || vmax > M / K) {
		printf ("NU\n");
	 }
	 else {
		  if (rand() % 100 > 60) {
			 printf ("DA\n");
		  }
		  else {
			   printf("NU\n");
		  }
	 }

}

int main() {
	srand(time(0));
	freopen ("sate2.in", "r", stdin);
	freopen ("sate2.out", "w", stdout);

	int t;

	scanf("%d", &t);
	while (t--) {
	  Solve();
    }

	return 0;
}