#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cstring>

using namespace std;

int n, c, m;
int t[300000];
int a, b;
map< int, vector<int> > mp;
int sol;

int main()
{
    int i;
    scanf("%d %d", &n, &c);
    for(i = 1; i <= n; ++i)
    {
        scanf("%d", t+i);
        mp[t[i]].push_back(i);
    }
    scanf("%d", &m);
    for(i = 0; i < m; ++i)
    {
        scanf("%d %d", &a, &b);
        map< int,vector<int> >::iterator it;
        for(it = mp.begin(); it != mp.end(); ++it)
        {
            sol =   upper_bound(it->second.begin(), it->second.end(), b)
                  - lower_bound(it->second.begin(), it->second.end(), a);
            //printf("sol = %d\n", sol);
            if(sol > (b - a + 1) / 2)
            {
                printf("da %d\n", it->first);
                goto kraj;
            }
        }
        printf("ne\n");
kraj:;
    }
    return 0;
}