#include <cstdio>

using namespace std;

const int MAXN = 300010;
const int MAXC = 101;

int n, c, m, a[ MAXN ], l, r, da;
int pre[ MAXC ][ MAXN ];

int main( void ) {

	scanf( "%d%d", &n, &c );
	for( int i = 1; i <= n; ++i ) {
		scanf( "%d", &a[ i ] );
		pre[ a[ i ] ][ i ] = 1;
	}
	
	for( int i = 1; i <= c; ++i ) {
		for( int j = 1; j <= n; ++j )
			pre[ i ][ j ] += pre[ i ][ j - 1 ];
	}
	
	scanf( "%d", &m );
	for( int i = 0; i < m; ++i ) {
		scanf( "%d%d", &l, &r );
		da = -1;
		for( int j = 1; j <= c; ++j ) {
			if( pre[ j ][ r ] - pre[ j ][ l - 1 ] > ( r - l + 1 ) / 2 ) da = j;
		}
		if( da != -1 ) printf( "da %d\n", da ); else printf( "ne\n" );
	}
	
	return 0;
	
}