//Matija Herceg
#include<iostream>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<fstream>
#include<string>
#include<algorithm>
#include<list>
#define MAXN 300000
using namespace std;
int n, m,c,kapa[MAXN];
int btr[10000];
int a,b;

void daj(){
     int mx=0, boja=0;
     a--; b--;
     memset(btr,0,sizeof(btr));
     for (int i=a; i<=b; i++){
         btr[kapa[i]]++;
     }
     for (int i=0; i<=c; i++){
         if (btr[i]>=mx){ mx=btr[i]; boja=i;}
     }
     if (mx>((b-a+1)/2)) cout<<"da "<<boja<<endl;
     else   cout<<"ne"<<endl;
}


int main(){
    cin>>n>>c;
    for (int i=0; i<n ;i++){
        cin>>kapa[i];
    }
    cin>>m;
    for (int i=0; i<m; i++){
        cin>>a>>b;
        daj();
    }
    
    //system("pause");
    return 0;
}