/*Write a program to take an integer array arr and an integer k as inputs. The task is to find the first negative
integer in each subarray of size k moving from left to right. If no negative exists in a window, print "0" for that
window. Print the results 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 found = 0;
 
        for (int j = i; j < i + k; j++) {
            if (arr[j] < 0) {
                printf("%d", arr[j]);
                found = 1;
                break;
            }
        }
 
        if (!found) printf("0");
 
        if (i != n - k) printf(" ");
    }
 
    return 0;
}
 

LypXcml0ZSBhIHByb2dyYW0gdG8gdGFrZSBhbiBpbnRlZ2VyIGFycmF5IGFyciBhbmQgYW4gaW50ZWdlciBrIGFzIGlucHV0cy4gVGhlIHRhc2sgaXMgdG8gZmluZCB0aGUgZmlyc3QgbmVnYXRpdmUKaW50ZWdlciBpbiBlYWNoIHN1YmFycmF5IG9mIHNpemUgayBtb3ZpbmcgZnJvbSBsZWZ0IHRvIHJpZ2h0LiBJZiBubyBuZWdhdGl2ZSBleGlzdHMgaW4gYSB3aW5kb3csIHByaW50ICIwIiBmb3IgdGhhdAp3aW5kb3cuIFByaW50IHRoZSByZXN1bHRzIHNlcGFyYXRlZCBieSBzcGFjZXMgYXMgb3V0cHV0LiovCiNpbmNsdWRlIDxzdGRpby5oPgoKaW50IG1haW4oKSB7CiAgICBpbnQgbiwgazsKICAgIHNjYW5mKCIlZCAlZCIsICZuLCAmayk7CgogICAgaW50IGFycltuXTsKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKQogICAgICAgIHNjYW5mKCIlZCIsICZhcnJbaV0pOwoKICAgIGZvciAoaW50IGkgPSAwOyBpIDw9IG4gLSBrOyBpKyspIHsKICAgICAgICBpbnQgZm91bmQgPSAwOwoKICAgICAgICBmb3IgKGludCBqID0gaTsgaiA8IGkgKyBrOyBqKyspIHsKICAgICAgICAgICAgaWYgKGFycltqXSA8IDApIHsKICAgICAgICAgICAgICAgIHByaW50ZigiJWQiLCBhcnJbal0pOwogICAgICAgICAgICAgICAgZm91bmQgPSAxOwogICAgICAgICAgICAgICAgYnJlYWs7CiAgICAgICAgICAgIH0KICAgICAgICB9CgogICAgICAgIGlmICghZm91bmQpIHByaW50ZigiMCIpOwoKICAgICAgICBpZiAoaSAhPSBuIC0gaykgcHJpbnRmKCIgIik7CiAgICB9CgogICAgcmV0dXJuIDA7Cn0K

NyAzCjEyIC0xIC03IDggLTE1IDMwIDE2Cg==

7 3
12 -1 -7 8 -15 30 16