#include<bits/stdc++.h>
#include<tr1/unordered_map>
using namespace std;
#define ll long long int

int  sml(ll a[] , int n){
	     ll mm=a[0];
          ll j;
	    for(int i=1;i<n;i++){
	    	if(a[i]>mm){
	    		mm=a[i];
                 j=i; 
			}
		}
		return j;	
	}
int main(){

		ll n,k;
		cin>>n>>k;
		ll c[n] ,d[n];
    for(int i=0;i<n;i++){
			cin>>c[i];
              d[i]=c[i];
		}
    
     for(int i=sml(c,n) +1 ;i<= sml(c,n)+k;i++){
         d[i]=0;
     }
    if(sml(c,n)>k){
          for(int i=sml(c,n)-k ;i<= sml(c,n);i++){
         d[i]=0;
     }
        cout<<rand()=100%4<<endl;
     }
	return 0;
}