#include <iostream>
#include <climits>

using namespace std;

int main()
{
    int n, k;
    cin >> n >> k;
    int A[n];
    for( int i = 0; i < n; ++i )
    {
        cin >> A[i];
    }
    int dp[n];
    dp[0] = A[0];
    for( int i = 1; i < n; ++i )
    {
        dp[i] = dp[i-1] + A[i];
    }
    int max_area = INT_MIN;
    int max_pos = -1001;
    for( int i = 0; i < n; ++i )
    {
        int bot = i - k;
        int top = min( i + k, n-1 );
        int area = 0;
        if( bot < 1 )
            area = dp[top];
        else
            area = dp[top] - dp[bot-1];

        if( area > max_area )
        {
            max_area = area;
            max_pos = i;
        }
    }

    cout << max_pos << endl;

    return 0;
}