#include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;

const int MaxN = 300001;

int n,c,m;
int a,b;


int niz [ MaxN ];
int num [ MaxN ];

int sum,poz;


int main ( ) {
    scanf("%d%d",&n,&c);
    for ( int i = 0 ; i < n ; i++)
        scanf("%d",&niz [ i ] );

    scanf("%d",&m);
    for ( int i = 0 ; i < m ; i++) {
        scanf("%d%d",&a,&b);
        memset ( num , 0 , sizeof num );
        sum = 0;
        for ( int j = a - 1 ; j < b ; j++) {
            num [ niz [ j ] ]++;
            if ( sum < num [ niz [ j ] ] ) {
                sum = num [ niz [ j ] ];
                poz = niz [ j ];
            }
        }

        if ( sum > ( b - a + 1 ) / 2 )
            printf("da %d\n",poz);
        else
            printf("ne\n");
    }

    return 0;
}