#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <vector>
#include <string>
#include <queue>
#include <algorithm>
#include <cctype>
#include <fstream>

using namespace std;
typedef pair<int, int> par;

par maxBr(int polje[], int start, int end){
		int index = start-1, maxVal = polje[start-1];
		for(int i = start; i < end-1; i++){
			if(maxVal < polje[i]){
				maxVal = polje[i];
				index = i;	
			}	
		}	
		return par(index, maxVal);
}

template <class T>
void op(T polje[], int len){
	for(int i = 0; i < len; i++){
		cout<<polje[i]<<" ";	
	}
	cout<<endl;
}

int main(){
	int n, c, m;
	scanf("%d %d", &n, &c);
	int patuljci[n];
	for(int i = 0; i < n; i++) scanf("%d", &patuljci[i]);
	scanf("%d", &m);
	int a, b, raz;
	for(int i = 0; i < m; i++){
		cin>>a>>b;
		raz = (b - a)+1;
		int boje[raz+1];
		memset(boje, 0, sizeof boje);
			
		for(int j = a-1; j <= b-1; j++){
			boje[patuljci[j]-1]++;
		}
		//op(boje, raz);
		if(maxBr(boje, a, b).second > raz/2) cout<<"da "<<boje[maxBr(boje, a, b).first]<<endl;
		else cout<<"ne\n";
	}
	//system("pause");
    return 0;
}