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

#define KONJ 42 - 42

using namespace std;

struct inter{ int lo, hi; } slike[10042];

int N, C, M;
int niz[300042];

void m(){

    int bla[N + 10];
    for ( int i = 0; i < M; ++i ){
    
        memset( bla, 0, sizeof( bla ) );
        for ( int j = slike[i].lo - 1 ; j <= slike[i].hi - 1; ++j ){ ++bla[ niz[j] ];  }
        int maks = 0, boja = -1;
        for ( int j = 0; j <= N; ++j ){
            if ( bla[j] > maks ){ maks = bla[j]; boja = j; }
        }

        if ( maks <= ( ( slike[i].hi - slike[i].lo ) + 1 ) / 2 ){ printf( "ne\n" ); continue; }
        printf( "da %d\n", boja );
    
    }

}

int main( void ){

    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", &slike[i].lo, &slike[i].hi );
    }
    // printf( "njnj" );
    m();
    
    

    return KONJ;

}