struct small {
    int id, num;

    small(int ii, int n) {
        id = ii;
        num = n;
    }

    bool operator < (const small & other)const {
        return num < other.num;
    }
};

struct big {
    int id, num;

    big(int ii, int n) {
        id = ii;
        num = n;
    }

    bool operator < (const big & other)const {
        return num > other.num;
    }
};
int a[1000005];
priority_queue<small> s;
priority_queue<big> b;

int main() {
//    small ss;
//    big bb;
    int n, k;
    scanf("%d%d", &n, &k);

    REP(i, n) {
        scanf("%d", a + i);
    }

    REP(i, k) {
        s.push(small(i, a[i]));
        b.push(big(i, a[i]));
    }
    
    
    FOR(i, k, n - 1) {
        while (b.top().id < (i - k)) {
            b.pop();
        }
        printf("%d ", b.top().num);
        //s.pop();

        b.push(big(i, a[i]));
    }
    while (b.top().id < (n - k)) {
        b.pop();
    }
    printf("%d\n", b.top().num);
    
    FOR(i, k, n - 1) {
        while (s.top().id < (i - k)) {
            s.pop();
        }
        printf("%d ", s.top().num);
        //s.pop();

        s.push(small(i, a[i]));
    }
    while (s.top().id < (n - k)) {
        s.pop();
    }
    printf("%d\n", s.top().num);

    
}