uva11991

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
int n, m,input,a,b;
int main()
{
    
	unordered_map<int, vector<int>> mmp;
	while (cin >> n >> m) {
    
		mmp.clear();
		for (int i = 0; i < n; i++) {
    
			cin >> input;
			mmp[input].push_back(i+1);
		}
		for (int i = 0; i < m; i++) {
    
			cin >> a >> b;
			a--;
			if (a < 0 ||mmp.count(b) == 0 || a >= mmp[b].size()) cout << 0 << endl;
			else cout << mmp[b][a] << endl;
		}
	}
	return 0;
}