#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

void rj(int a, int b);

int P[300100];
int n,c,m;

int main()
{
    cin>>n>>c;
    for (int i=1; i<=n; i++)
    {
        int tmp;
        cin>>tmp;
        P[i] = tmp;
    }
    cin>>m;
    for (int i =0; i<m; i++)
    {
     int a,b;
     cin>>a>>b;
     rj(a,b);   
    }
}

void rj(int a, int b)
{
int K[100];
memset(K, 0, sizeof(K));
for (int i = a; i<=b; i++)
{K[ P[i] ]++;}
int p = 0;
p=*max_element(K, K+90);
if (p>((b-a)+1>>1)) 
{
      cout<<"da "; 
      for (int i =1; i<=90; i++) 
      if (p==K[i]) cout<<i<<endl;
}
else cout<<"ne"<<endl;
}