There is a fence in front of Polycarpus's home. The fence consists of n planks of the same width which go one after another from left to right. The height of the i-th plank is hi meters, distinct planks can have distinct heights.

<image> Fence for n = 7 and h = [1, 2, 6, 1, 1, 7, 1]

Polycarpus has bought a posh piano and is thinking about how to get it into the house. In order to carry out his plan, he needs to take exactly k consecutive planks from the fence. Higher planks are harder to tear off the fence, so Polycarpus wants to find such k consecutive planks that the sum of their heights is minimal possible.

Write the program that finds the indexes of k consecutive planks with minimal total height. Pay attention, the fence is not around Polycarpus's home, it is in front of home (in other words, the fence isn't cyclic).

Input

The first line of the input contains integers n and k (1 ≤ n ≤ 1.5·105, 1 ≤ k ≤ n) — the number of planks in the fence and the width of the hole for the piano. The second line contains the sequence of integers h1, h2, ..., hn (1 ≤ hi ≤ 100), where hi is the height of the i-th plank of the fence.

Output

Print such integer j that the sum of the heights of planks j, j + 1, ..., j + k - 1 is the minimum possible. If there are multiple such j's, print any of them.

Examples

Input

7 3
1 2 6 1 1 7 1


Output

3

Note

In the sample, your task is to find three consecutive planks with the minimum sum of heights. In the given case three planks with indexes 3, 4 and 5 have the required attribute, their total height is 8.
# Fence
from typing import List


class Solution:

    @classmethod
    def solve(cls, n: int, k: int, heights: List[int]) -> int:
        sum_arr = [0]
        for index, element in enumerate(heights):
            sum_arr.append(element + sum_arr[index])
        min_cost = 15000001
        min_index = 0
        for i in range(k, n+1):
            cost = sum_arr[i] - sum_arr[i-k]
            if min_cost > (sum_arr[i] - sum_arr[i-k]):
                min_cost = sum_arr[i] - sum_arr[i-k]
                min_index = i
        return min_index - k + 1

    @classmethod
    def dp_solve(cls, n: int, k: int, heights: List[int]) -> int:
        """
        Solving using dynamic programming
        """

        if k == n and sum(heights) == n:
            return 1
        else:
            sum_arr = []
            for index, element in enumerate(heights):
                if index == 0:
                    sum_arr.append(element)
                else:
                    sum_arr.append(element + sum_arr[index-1])
            min_cost = 15000000
            min_index = 0
            for index, element in enumerate(sum_arr[:-k]):
                if k == 2:
                    cost = abs(heights[index+1] - heights[index])
                else:
                    if index == 0:
                        cost = sum_arr[k-1] - sum_arr[0]
                    else:
                        cost = sum_arr[index+k-1] - sum_arr[index]
                if cost < min_cost:
                    min_cost = cost
                    min_index = index
            return min_index + 1

    @classmethod
    def brute_force_solve(cls, n: int, k: int, heights: List[int]) -> int:
        """
        Function to compute the number of planks with minimum height to be removed for the piano to fit.
        """
        if k == n and sum(heights) == n:
            return 1
        else:
            min_cost = 500
            reqd_index = -1
            for index, plank in enumerate(heights[:k]):
                numbers = heights[index : index + k]
                cost = sum(numbers)
                if cost < min_cost:
                    reqd_index = index
                    min_cost = cost
            return reqd_index + 1


if __name__ == "__main__":
    [n, k] = list(map(lambda x: int(x), input().split()))
    heights = list(map(lambda x: int(x), input().split()))
    result = Solution.solve(n, k, heights)
    print(result)
