80分

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
//#pragma GCC optimize(2)
using namespace std;
typedef long long ll;
int n, q;
int a[1010], b[1010][2];
int main(){
	cin >> n >> q;
	for (int i = 1; i <= n; i++){
		cin >> a[i];
	}
	for (int i = 1; i <= n; i++){
		cin >> b[i][0] >> b[i][1];
	}
	for (int i = 1; i <= q; i++){
		int sum = 0;
		int mod = pow(10, b[i][0]);
		for (int j = 1; j <= n; j++){
			if (a[j] % mod == b[i][1]){
				sum++;
			}
		}
		cout << sum << endl;
	}
	return 0;
}