Next Round

Source: Codeforces

Version: Phuoc Hung OJ Extended

Problem

$n$ contestants have scores in non-increasing order: $a_1\ge a_2\ge\cdots\ge a_n$. A contestant advances iff the score is positive and at least the score of the contestant in place $k$.

With threshold $T=a_k$, count the indices satisfying $a_i>0$ and $a_i\ge T$.

Input

• Line 1: integers $n,k$.
• Line 2: $n$ scores.

Output

Print the number of advancing contestants.

Subtask

Subtask 1 (100 points): $1\le k\le n\le50$; $0\le a_i\le100$; $a_0\ge a_1\ge\cdots\ge a_{n-1}$.

Example

Input

8 5
10 9 8 7 7 7 5 5

Output

6

Explanation

The threshold is $7$; the first six positive scores are at least $7$.