{"trustable":true,"sections":[{"title":"Description","value":{"format":"MD","content":"Input $n$ non-negative integers not exceeding $10^9$ in a non-decreasing order, and then perform $m$ queries. For each query, an integer $q$ is given, and the task is to output the index of the first occurrence of this number in the sequence, or $-1$ if not found."}},{"title":"Input","value":{"format":"MD","content":"The first line contains $2$ integers $n$ and $m$, indicating the number of integers and the number of queries.\n\nThe second line contains $n$ integers, representing the numbers to be queried.\n\nThe third line contains $m$ integers, representing the indices of these numbers to be queried, starting from $1$."}},{"title":"Output","value":{"format":"MD","content":"Output a line of $m$ integers separated by spaces, representing the answers."}},{"title":"Sample 1","value":{"format":"MD","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e11 3\n1 3 3 3 5 7 9 11 13 15 15\n1 3 6\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e1 2 -1 \u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e"}},{"title":"Hint","value":{"format":"MD","content":"It is guaranteed that $1 \\leq n \\leq 10^6$, $0 \\leq a_i,q \\leq 10^9$, $1 \\leq m \\leq 10^5$.\n\nDue to the large amount of input and output in this problem, please use a faster I/O method."}}]}