#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int A=1005;
long long b[A],x[A],e[A],d[A]; 
int n,q;
int main(){
    cin>>n>>q;
    for (int i=1;i<=n;i++)
       e[i]=1;
    for (int i=1;i<=n;i++)
        cin>>b[i];
    sort(b,b+n+1); 
    for (int i=1;i<=q;i++){
        cin>>d[i]>>x[i];
        for (int j=1;j<=d[i];j++)
            e[i]*=10;
    }
    for (int i=1;i<=q;i++){
        for (int j=1;j<=n;j++)
            if (b[j]%e[i]==x[i]){
                cout<<b[j]<<endl;
                break;
            }
            else if (j==n){
                cout<<"-1"<<endl;
                break;
            }    
    }
    return 0;
}