B3667

#include <cstdio>
const int N = 1e6 + 7;
int n, k, begin, end;
int q[N];
unsigned long long a[N];
int main() {
	std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0);
	std::cin >> n >> k;
	for(int i = 1; i <= n; i++)
		std::cin >> a[i];
	for(int i = 1; i + k - 1 <= n; i++) {
		int r = i + k - 1;
		while(end - begin > 0 && q[begin] < i)
			begin++;
		while(end - begin > 0 && a[q[end - 1]] <= a[r])
			end--;
		q[end++] = r;
		std::cout << end - begin << '\n';
	}
	
	return 0;
}

試點其一有正解，餘者盡誤