# include <cstdio>
# include <iostream>
# include <vector>
# include <cstring>

using namespace std;

vector <int> kapice;
vector < pair<int, int> > query;
int N, M, C, t, t2;
int tmp[ 10010 ];

void brute(){
	for( int i = 0 ; i < M ; ++i ){
		int kol, maks, id;
		maks = 0;
		kol = 0;
		id = -1;
		memset( tmp, 0, sizeof tmp );
		for( int j = query[ i ].first - 1 ; j < query[ i ].second ; ++j ){
			tmp[ kapice[ j ] ]++;
			if( max( tmp[ kapice[ j ] ], maks ) == maks ) kol++;
			else{
				kol = 1;
				maks = tmp[ kapice[ j ] ];
				id = j;
			}
		}
		if( kol == 1 ) printf( "da %d\n", kapice[ id ] );
		else printf ( "ne\n" );
	}
	return;
}

int main( void ){
	scanf( "%d %d", &N, &C );
	for( int i = 0 ; i < N ; ++i ){
		scanf( "%d", &t );
		kapice.push_back( t );
	}
	scanf( "%d", &M );
	for( int i = 0 ; i < M ; ++i ){
		scanf( "%d %d", &t, &t2 );
		query.push_back( make_pair( t, t2 ) );
	}
	brute();
	// system( "PAUSE" );
	return 0;
}
