{"raw_statement":[{"iden":"problem statement","content":"You are given a sequence $P$ that is a permutation of $(1,2,…,N)$, and an integer $X$. The $i$\\-th term of $P$ has a value of $P_i$. Print $k$ such that $P_k = X$."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 100$\n*   $1 \\leq X \\leq N$\n*   $P$ is a permutation of $(1,2,…,N)$.\n*   All values in the input are integers."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$ $X$\n$P_1$ $P_2$ $\\ldots$ $P_N$"},{"iden":"sample input 1","content":"4 3\n2 3 1 4"},{"iden":"sample output 1","content":"2\n\nWe have $P = (2,3,1,4)$, so $P_2 = 3$. Thus, you should print $2$."},{"iden":"sample input 2","content":"5 2\n3 5 1 4 2"},{"iden":"sample output 2","content":"5"},{"iden":"sample input 3","content":"6 6\n1 2 3 4 5 6"},{"iden":"sample output 3","content":"6"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}