图书管理员

#include <iostream>
#include <cmath>
#include <climits>
using namespace std;
int len, x, a[1005], n, q;
int main()
{
	cin >> n >> q;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	int mi;
	for (int i = 1; i <= q; i++) {
		cin >> len >> x;
		mi = INT_MAX;
		for (int j = 1; j <= n; j++) {
			int t = pow(10, len);
			if (a[j] % t == x && a[j] < mi) {
				mi = a[j];
			}
		}
		if (mi == INT_MAX) {
			cout << -1 << endl;
		}
		else {
			cout << mi << endl;
		}
	}
	return 0;
}