#include <bits/stdc++.h>

using namespace std;

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


bool solve() {

    int n,m,k;
    fin>>n>>m>>k;

    vector<int> v;
    for(int i=0;i<n;i++) {
        int x;
        fin>>x;
        v.push_back(x);
    }

    sort(v.begin(), v.end(), greater<int>());

    int maxim=m/k;
    int sate[5]= {0};

    for(auto x:v) {
        bool found=false;
        for(int i=k-1; i>=0; i--) {
            if(sate[i]+x<=maxim) {
                sate[i]+=x;
                found=true;
                break;
            }
        }
        if(!found) return false;
        sort(sate,sate+k);
    }

    for(int i=0; i<k; i++) {
        if(sate[i] != maxim) return false;
    }
    return true;
}

int main()
{
    int t;
    fin>>t;

    while(t--) {
        if(solve()){
            fout << "DA\n";
        } else {
            fout << "NU\n";
        }
    }
    return 0;
}