#include <iostream>

using namespace std ;

int n,c,pat[ 300001 ],m,a[ 10001 ],b[ 10001 ],e[ 300001 ],k,d[ 300002 ],maks,maksb ;

int main ( void ) {
    cin >> n >> c ;
    for ( int i = 0 ; i < n ; i++ ) cin >> pat[ i ] ;
    cin >> m ;
    for ( int i = 0 ; i < m ; i++ ) cin >> a[ i ] >> b[ i ] ;
    for ( int i = 0 ; i < m ; i++ ) {
        k = b[ i ] - a[ i ] + 1 ;
        for ( int j = a[ i ] - 1 ; j < b[ i ] ; j++ ) e[ j ] = pat[ j ] ;
        for ( int j = 1 ; j < c + 1 ; j++ ) {
                d[ j ] = 0 ;
                for ( int l = 0 ; l < k ; l++ ) if ( e[ l ] == j ) d[ j ]++ ;
        }
        for ( int j = 1 ; j < c + 1 ; j++ ) {
            if ( d[ j ] > maks ) {
                maks = d[ j ] ;
                maksb = j ;
            }
        }
        if ( maks > k/2 )
            cout << "da" << ' ' << maksb << endl ;
        else
            cout << "ne" << endl ;
    }
    return 0 ;
}