const int maxm = 1e6+;

int buf[maxm], maxq[maxm], minq[maxm], ans1[maxm], ans2[maxm];

int main() {

    ios::sync_with_stdio(false), cin.tie();

    int n, k, l1 = , r1 = -, l2 = , r2 = -;

    cin >> n >> k;

    for(int i = ; i < n; ++i)

        cin >> buf[i];

    for(int i = ; i < n; ++i) {

        while(l1 <= r1 && minq[l1] <= i-k) l1++;

        while(l2 <= r2 && maxq[l2] <= i-k) l2++;

        while(l1 <= r1 && buf[minq[r1]] >= buf[i]) r1--;

        minq[++r1] = i;

        while(l2 <= r2 && buf[maxq[r2]] <= buf[i]) r2--;

        maxq[++r2] = i;

        if(i >= k-) ans1[i] = buf[minq[l1]], ans2[i] = buf[maxq[l2]];

    }

    for(int i = k-; i < n; ++i) {

        if(i!=k-) cout << " ";

        cout << ans1[i];

    }

    cout << "\n";

    for(int i = k-; i < n; ++i) {

        if(i!=k-) cout << " ";

        cout << ans2[i];

    }

    cout << "\n";

    return ;

}