/*Write a program to take an integer array arr and an integer k as inputs. The task is to find the maximum 
element in each subarray of size k moving from left to right. Print the maximum elements for each window 
separated by spaces as output.*/
#include <stdio.h>
 
int main() {
    int n, k;
    scanf("%d %d", &n, &k);
 
    int arr[n];
    for (int i = 0; i < n; i++)
        scanf("%d", &arr[i]);
 
    for (int i = 0; i <= n - k; i++) {
        int max = arr[i];
        for (int j = i; j < i + k; j++) {
            if (arr[j] > max)
                max = arr[j];
        }
        printf("%d", max);
        if (i != n - k) printf(" ");
    }
 
    return 0;
}
 

LypXcml0ZSBhIHByb2dyYW0gdG8gdGFrZSBhbiBpbnRlZ2VyIGFycmF5IGFyciBhbmQgYW4gaW50ZWdlciBrIGFzIGlucHV0cy4gVGhlIHRhc2sgaXMgdG8gZmluZCB0aGUgbWF4aW11bSAKZWxlbWVudCBpbiBlYWNoIHN1YmFycmF5IG9mIHNpemUgayBtb3ZpbmcgZnJvbSBsZWZ0IHRvIHJpZ2h0LiBQcmludCB0aGUgbWF4aW11bSBlbGVtZW50cyBmb3IgZWFjaCB3aW5kb3cgCnNlcGFyYXRlZCBieSBzcGFjZXMgYXMgb3V0cHV0LiovCiNpbmNsdWRlIDxzdGRpby5oPgoKaW50IG1haW4oKSB7CiAgICBpbnQgbiwgazsKICAgIHNjYW5mKCIlZCAlZCIsICZuLCAmayk7CgogICAgaW50IGFycltuXTsKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKQogICAgICAgIHNjYW5mKCIlZCIsICZhcnJbaV0pOwoKICAgIGZvciAoaW50IGkgPSAwOyBpIDw9IG4gLSBrOyBpKyspIHsKICAgICAgICBpbnQgbWF4ID0gYXJyW2ldOwogICAgICAgIGZvciAoaW50IGogPSBpOyBqIDwgaSArIGs7IGorKykgewogICAgICAgICAgICBpZiAoYXJyW2pdID4gbWF4KQogICAgICAgICAgICAgICAgbWF4ID0gYXJyW2pdOwogICAgICAgIH0KICAgICAgICBwcmludGYoIiVkIiwgbWF4KTsKICAgICAgICBpZiAoaSAhPSBuIC0gaykgcHJpbnRmKCIgIik7CiAgICB9CgogICAgcmV0dXJuIDA7Cn0K

OCAzCjEgMyAxIDIgMCA1IDQgNgo=

8 3
1 3 1 2 0 5 4 6