\textit{Though Rujia Liu usually sets hard problems for contests (for example, regional contests like Xi'an 2006, Beijing 2007 and Wuhan 2009, or UVa OJ contests like Rujia Liu's Presents 1 and 2), he occasionally sets easy problem (for example, 'the Coco-Cola Store' in UVa OJ), to encourage more people to solve his problems :D} Given an array, your task is to find the \textbf{k}-th occurrence (from left to right) of an integer \textbf{v}. To make the problem more difficult (and interesting!),you'll have to answer m such queries. \InputFile There are several test cases. The first line of each test case contains two integers \textbf{n}, \textbf{m} (\textbf{1} ≤ \textbf{n}, \textbf{m} ≤ \textbf{100,000}), the number of elements in the array, and the number of queries. The next line contains \textbf{n} positive integers not larger than \textbf{1,000,000}. Each of the following \textbf{m} lines contains two integer \textbf{k} and \textbf{v} (\textbf{1} ≤ \textbf{k} ≤ \textbf{n}, \textbf{1} ≤ \textbf{v} ≤ \textbf{1,000,000}). The input is terminated by end-of-file (\textbf{EOF}). The size of input file does not exceed \textbf{5} MB. \OutputFile For each query, print the \textbf{1}-based location of the occurrence. If there is no such element, output \textbf{0} instead.