Round

Round

Problem

“Contestant who earns a score equal to or greater than the k
-th place finisher’s score will advance to the next round, as long as the contestant earns a positive score…” — an excerpt from contest rules.

A total of n participants took part in the contest (n≥k), and you already know their scores. Calculate how many participants will advance to the next round.

Input

The first line of the input contains two integers n and k (1≤k≤n≤50) separated by a single space.

The second line contains n space-separated integers $a_1,a_2,\dots ,a_n(0\le a_i\le 100),$ where ai is the score earned by the participant who got the i-th place. The given sequence is non-increasing (that is, for all i from 1 to n−1 the following condition is fulfilled: $a_i\ge a_{i+1}$).

Output

Output the number of participants who advance to the next round.

Examples

Input

8 5
10 9 8 7 7 7 5 5

Output

6

Input

4 2
0 0 0 0

Output

0

Note

In the first example the participant on the 5th place earned 7 points. As the participant on the 6th place also earned 7 points, there are 6 advancers.

In the second example nobody got a positive score.

Code

// #include <iostream>
// #include <algorithm>
// #include <cstring>
// #include <sstream>//整型转字符串
// #include <stack>//栈
// #include <deque>//堆/优先队列
// #include <queue>//队列
// #include <map>//映射
// #include <unordered_map>//哈希表
// #include <vector>//容器，存数组的数，表数组的长度
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

int main()
{
    ll n,k;
    cin>>n>>k;

    ll sum=0,op=0,y=0;
    while(n--)
    {
        ll x;
        cin>>x;

        if(x<=0) continue;
        y++;
        if(sum<k||op==x) sum++;
        if(y==k) op=x;
    }

    cout<<sum<<endl;
    return 0;
}