K-th minimum#5201

K-th minimum

1 second

128 megabytes

Very easy

Find the $k$ -th number in array $A = ⟨ a_{1}, a_{2}, \dots, a_{n} ⟩$ A = \langle a_1, a_2, \ldots, a_n \rangle sorted in increasing order.

Array $A$ is generated with the polynom $P (x) = 132 x^{3} + 77 x^{2} + 1345 x + 1577$ P(x) = 132x^3 + 77x^2 + 1345x + 1577: $a_{i} = P (i) mod 1743$ a_i = P(i)\bmod 1743.

Input

Two positive integers $n$ and $k$ ( $1 \leq k \leq n \leq 50000$ 1 \leq k \leq n \leq 50000).

Output

Print the $k$ -th number in sorted array $A$ .

Examples

Example 1

Loading

Example 2

Loading

A = ⟨ a_{1}, a_{2}, \dots, a_{n} ⟩

P (x) = 132 x^{3} + 77 x^{2} + 1345 x + 1577

a_{i} = P (i) mod 1743

1 \leq k \leq n \leq 50000