^{-1}

AtCoder

IDabc277_a

Time2000ms

Memory256MB

Difficulty—

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$. ## Constraints * $1 \leq N \leq 100$ * $1 \leq X \leq N$ * $P$ is a permutation of $(1,2,…,N)$. * All values in the input are integers. ## Input The input is given from Standard Input in the following format: $N$ $X$ $P_1$ $P_2$ $\ldots$ $P_N$ [samples]

Samples

Input #1

4 3
2 3 1 4

Output #1

2

We have $P = (2,3,1,4)$, so $P_2 = 3$. Thus, you should print $2$.

Input #2

5 2
3 5 1 4 2

Output #2

Input #3

6 6
1 2 3 4 5 6

Output #3

API Response (JSON)

{
  "problem": {
    "name": "^{-1}",
    "description": {
      "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$.",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc277_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "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$.\n\n## Constraints\n\n*   $1 \\leq N \\leq ...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments