#include <cstdio>
#include <algorithm>
#include <vector>

using namespace std;

int n, m, q;
vector<int> v[100], u[10100];

int cnt(vector<int> &x, int a, int b) {
  int ans = 0;
  ans += lower_bound(x.begin(), x.end(), b+1) - x.begin();
  ans -= lower_bound(x.begin(), x.end(), a) - x.begin();
  return ans;
}

int main(void) {
  scanf("%d%d", &n, &m);
  for (int i=0; i<n; ++i) {
    int x; scanf("%d", &x); --x;
    u[x].push_back(i);
    v[x/100].push_back(i);
  }
  scanf("%d", &q);
  for (int i=0; i<q; ++i) {
    int a, b; scanf("%d%d", &a, &b);
    --a, --b;
    int ok = 1;
    for (int j=0; j<100; ++j) {
      int x = cnt(v[j], a, b);
      if (x*2 > b-a+1) {
        for (int k=0; k<100; ++k) {
          x = cnt(u[j*100+k], a, b);
          if (x*2 > b-a+1) {
            printf("da %d\n", j*100+k+1);
            ok = 0;
            break;
          }
        }
      }
      if (!ok) break;
    }
    if (ok) printf("ne\n");
  }
  return 0;
}