#include<iostream>
#include <algorithm>
#include <cstring>

using namespace std;

int main()
    {
    int i,n,k,j,kap[300001],odg2[10001],pr,dr,m,niz[10001]={0};
    string odg[10001];
    
    cin>>n>>k;
    for (i=1;i<=n;i++)
        cin>>kap[i];
    cin>>m;
    for (i=1;i<=m;i++)
        {
        cin>>pr>>dr;
        odg[i]="ne";
        memset(niz,0,sizeof niz);
        for (j=pr;j<=dr;j++)
            {
            niz[kap[j]]++;
            //cout<<"RAZLIKA: "<<dr-pr+1<<" KAP: "<<niz[kap[j]]<<" ";
            if (niz[kap[j]] > (dr-pr+1)/2)
               {
               odg[i]="da";
               odg2[i]=kap[j];
               
               }
               }
               }
    for (i=1;i<=m;i++)
        {
        
        if (odg[i] == "da")
           {
           cout<<odg[i];
           cout<<" "<<odg2[i]<<endl;
           }
        else
            cout<<odg[i]<<endl;
            }
    //system("pause");
    return 0;

}