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.
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

// CFPS -> CodeForcesProblemSet
public final class CFPS {
	static FastReader fr = new FastReader();
	static PrintWriter out = new PrintWriter(System.out);

	public static void main(String[] args) {
		int n = fr.nextInt(), k = fr.nextInt();
		int[] height = fr.nextIntArray(n);
		if (n == 1) {
			out.println(1);
			out.close();
			return;
		}
		int[] dp = new int[n];
		dp[0] = height[0];
		for (int i = 1; i < k; i++) {
			dp[i] = dp[i - 1] + height[i];
		}
		for (int i = k; i < n; i++) {
			dp[i] += dp[i - 1] + height[i] - height[i - k];
		}
		int min = Integer.MAX_VALUE;
		int minIdx = -1;
		for (int i = k - 1; i < n; i++) {
			if (dp[i] < min) {
				min = dp[i];
				minIdx = i;
			}
		}
		out.println((minIdx - (k - 1)) + 1);
		out.close();
	}

	// Code from geeksforgeeks.org
	// Time Complexity: O(sqrt(n))
	static boolean isPrime(int n) {
		// Corner cases
		if (n <= 1)
			return false;
		if (n <= 3)
			return true;

		// This is checked so that we can skip
		// middle five numbers in below loop
		if (n % 2 == 0 || n % 3 == 0)
			return false;

		for (int i = 5; i * i <= n; i = i + 6)
			if (n % i == 0 || n % (i + 2) == 0)
				return false;

		return true;
	}

	static int hash(String s, int arrayLen) {
		return (s.hashCode() & 0x7fffffff) % arrayLen;
	}

	static class FastReader {
		// The input stream is read and stored into a buffer which can be used to
		// retrieve
		// data whenever required. This reduces the # of IO operations thus ensuring
		// fast input.

		// BufferedReader for input buffering and StringTokenizer for splitting the
		// input
		// line by line into string tokens which can be parsed manually for the desired
		// data.
		private BufferedReader bfr;
		private StringTokenizer st;

		public FastReader() {
			// Passing an InputStreamReader to the BufferedReader constructor (using the
			// console
			// input stream).
			bfr = new BufferedReader(new InputStreamReader(System.in));
		}

		// Method to return the next String token which can be parsed further.
		String next() {
			// Initializing (if required)/Resetting by creating tokens from the
			// next line.
			// If there are no more elements from the current line:
			if (st == null || !st.hasMoreElements()) {
				try {
					// Creating tokenizer using the next line.
					st = new StringTokenizer(bfr.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		// Parsing the next token to an Integer.
		int nextInt() {
			return Integer.parseInt(next());
		}

		// Parsing the next token to a Long.
		long nextLong() {
			return Long.parseLong(next());
		}

		// Parsing the next token to a Double.
		double nextDouble() {
			return Double.parseDouble(next());
		}

		// Parsing the next token to a Character.
		char nextChar() {
			return next().toCharArray()[0];
		}

		// Reading a whole string.
		String nextString() {
			return next();
		}

		// Parsing the input tokens to an integer array of
		// the specified size.
		int[] nextIntArray(int n) {
			int[] arr = new int[n];
			for (int i = 0; i < n; i++)
				arr[i] = nextInt();
			return arr;
		}

		// Parsing the input token to a double array of
		// the specified size.
		double[] nextDoubleArray(int n) {
			double[] arr = new double[n];
			for (int i = 0; i < arr.length; i++)
				arr[i] = nextDouble();
			return arr;
		}

		long[] nextLongArray(int n) {
			long[] arr = new long[n];
			for (int i = 0; i < n; i++)
				arr[i] = nextLong();
			return arr;
		}
	}
}
