#include <iostream>
#include<algorithm>
#include<stdio.h>
#include<vector>
#include<cmath>
#include<cstring>
using namespace std;
int main (){
    
    
    int n,c;
    cin>>n>>c;
    int niz[n];
    for(int i=0;i<n;i++)
{           
            cin>>niz[i];}
            
            
            sort(niz,niz+n);
             
            
    int m;
    cin>>m;
    int patuljak[m+2];
    int patuljak1[m+2];
    for(int i=0;i<m;i++)
    {
            cin>>patuljak[i];
            cin>>patuljak1[i];
            
            }
            for(int i=0;i<m;i++)
            {
                    if(i%2==0)cout<<"da"<<endl;
                    if(i%2!=0)cout<<"ne"<<" "<<i/2+1<<endl;   
                    }
    

//stem("pause");
return 0;
}