import java.lang.*;
import java.util.*;

public class FraudulentActivityNotifications
{
	public static void main(String[] args)
	{
		Scanner in = new Scanner(System.in);

		int n = in.nextInt();
		int d = in.nextInt();

		int[] expenditures = collectInput(in,n);
		int notifications = computeNotifications(expenditures,d);
		printResult(notifications);
	}

	public static int[] collectInput(Scanner in, int n)
	{
		int[] expenditures = new int[n];
		for(int i = 0; i < n; i++)
			expenditures[i] = in.nextInt();

		in.close();

		return expenditures;
	}

	public static int computeNotifications(int[] expenditures, int d)
	{
		int n = expenditures.length;
		int notifications = 0;

		Queue<Integer> medianArray = new LinkedList<Integer>();

		int i = 0;
		while(i < n)
		{
			if(medianArray.size() < d)
				medianArray.add(expenditures[i]);
			
			else
			{
				int[] medianSortedArray = sortMedianArray(medianArray);
				double median = getMedian(medianSortedArray);

				boolean toNotify = check(expenditures[i],median);
				if(toNotify)
					notifications++;

				medianArray.remove();
				medianArray.add(expenditures[i]);
			}

			i++;
		}

		return notifications;
	}

	public static void printResult(int notifications)
	{
		System.out.println(notifications);
	}

	private static int[] sortMedianArray(Queue<Integer> subArray)
	{
		int maxIndex = (Integer) Collections.max(subArray,null);
		int[] countArray = new int[maxIndex+1];

		int d = subArray.size();
		ArrayList<Integer> subArrayAsList = new ArrayList<Integer>(subArray);

		for(int elem : subArrayAsList)
			countArray[elem]++;

		int[] sortedMedianArray = new int[d];
		int index = 0;

		for(int i = 0; i < countArray.length; i++)
		{
			int repeat = countArray[i];
			while(repeat > 0)
			{
				sortedMedianArray[index++] = i;
				repeat--;
			}
		}

		return sortedMedianArray;
	}

	private static double getMedian(int[] medianArray)
	{
		int d = medianArray.length;
		double median;

		if(d % 2 == 1) // odd
		{
			int medianPosition = (d + 1) / 2;
			int medianIndex = medianPosition - 1;

			median = (double) medianArray[medianIndex];
		}
		else // even
		{
			int medianPosition1 = d/2;
			int medianPosition2 = d/2 + 1;

			int medianIndex1 = medianPosition1 - 1;
			int medianIndex2 = medianPosition2 - 1;

			median = computeAverage(medianArray[medianIndex1],medianArray[medianIndex2]);
		}
		return median;
	}

	private static double computeAverage(int num1, int num2)
	{
		return ((double)num1 + (double)num2) / 2;
	}

	private static boolean check(int expenditure, double median)
	{
		if(expenditure >= (2 * median))
			return true;

		return false;
	}
}