#include <iostream>
#include <vector>

using namespace std;

int unos[300003];

vector <int> poj;

struct tip {   
   int broj;
   int puta;
};

tip niz[100001];
int rj1[10001], rj2[10001];

int prebroji(int a, int b)
{
    int el = 0, i, j;
    for(int i = a-1; i != b; i++)
    {
          int koliko = 0;  
          for(j = 0; j != el; j++)
                if(unos[i] == niz[j].broj)
                               koliko++;
          if(koliko == 0)
          {
                    niz[el].broj = unos[i];
                    niz[el].puta = 1;
                    el++;
          }
          else
          {
                    bool nalaz = false;
                    for(j = 0; nalaz != true; j++)
                          if(niz[j].broj == unos[i])
                          {
                                         niz[j].puta++; nalaz = true;
                          }
          }
    }
    for (int i=1; i < el; i++) 
    {
        for (int j=0; j < el-i; j++) 
        {
            if (niz[j].puta < niz[j+1].puta)
               swap(niz[j], niz[j+1]);
        }
    }
    return niz[0].broj;
}   

int prebroji2(int a, int b)
{
    int el = 0, i, j;
    for(int i = a-1; i != b; i++)
    {
          int koliko = 0;  
          for(j = 0; j != el; j++)
                if(unos[i] == niz[j].broj)
                               koliko++;
          if(koliko == 0)
          {
                    niz[el].broj = unos[i];
                    niz[el].puta = 1;
                    el++;
          }
          else
          {
                    bool nalaz = false;
                    for(j = 0; nalaz != true; j++)
                          if(niz[j].broj == unos[i])
                          {
                                         niz[j].puta++; nalaz = true;
                          }
          }
    }
    /*for(i = 0; i != el; i++)
          cout << niz[i].broj << " " << niz[i].puta << endl;
    system("PAUSE");*/
    for (int i=1; i < el; i++) 
    {
        for (int j=0; j < el-i; j++) 
        {
            if (niz[j].puta < niz[j+1].puta)
               swap(niz[j], niz[j+1]);
        }
    }
    /*cout << niz[0].puta;
    system("PAUSE");*/
    return niz[0].puta;
}                

int main()
{
    int  N, C, i, a, b, M;
    cin >> N >> C;
    for(i = 0; i != N; i++)
          cin >> unos[i];
    cin >> M;
    for(i = 0; i != M; i++)
    {
          cin >> a >> b;
          int max = prebroji2(a, b);
          if(max > (b - a + 1)/2)
          {
                 rj1[i] = 1; rj2[i] = prebroji(a, b);
          }
          else
          {
                 rj1[i] = 0; rj2[i] = 0;
          }
    }
    for(i = 0; i != M; i++)
    {
          if(rj1[i] == 1)
                    cout << "da " << rj2[i] << endl;
          else
                    cout << "ne" << endl;
    }
    return 0;
}