n,w,h=map(int,input().split())
length=[]
max=pow((w**2+h**2),1/2)
min0=min(w,h)
for i in range(0,n):
    length.append(int(input()))
for i in range(0,n):
    if max>=length[i]>=min0:
        print('DA')
    else:
        print('NE')