k-th element - MarisaOJ: Marisa Online Judge

For an array

A

$A$ of

n

$n$ integers, you need to process

q

$q$ queries, each belonging to one of the three types: -

1 x

$1 x$ : Add the value

x

$x$ to the end of array

A

$A$ . -

2

$2$ : Remove the last value from array

A

$A$ . It is guaranteed that

A

$A$ has at least one element at this point. -

3 k

$3 k$ : Find the element with index

k

$k$ in the array, array indices starting from

1

$1$ . ### Input - The first line consists of two integers

n, q

$n, q$ . - The second line contains

n

$n$ integers

A_{i}

$A_i$ . - The next

q

$q$ lines, each containing a query in the specified format. ### Output - Output an integer as the answer for each type

3

$3$ query. ### Constraints -

1 \leq n, q \leq 10^{5}

$1 \le n, q \le 10^5$ . -

1 \leq x \leq 10^{9}

$1 \le x \le 10^9$ . -

1 \leq k \leq | A |

$1 \le k \le |A|$ where

| A |

$|A|$ is the length of array

A

$A$ at the time of the query. ### Sample test Input

54123451636232

$5 4 1 2 3 4 5 1 6 3 6 2 3 2$

Output:

62

$6 2$

Topic

STL

Rating

800

Solution (1)

Solution