#include <iostream>
#include <stdio.h>

using namespace std;

const int nmax = 100010;

int n,v[nmax],ci,cf,nrop,val,mx;
int a[nrmax>>2];

void read()
{
    int i=0;
    cin>>n;
    cin>>nrop;
    while(i<n)
    {
        cin>>v[++i];
        poz=i;val=v[i];
        in(1,1,n);

    }

}

void in(int nod,int inf,int sup)
{
    if(inf==sup)
        a[inf]=val;
    else
    {
        int mid=(inf+sup)/2;
        if(poz<mid)
            in(nod*2,inf,mid);
        else
            in(nod*2+1,mid+1,sup);
        a[nod] = (a[nod*2]>a[nod*2+1]) ? a[nod*2] : a[nod*2+1];

    }

}

int  maxim (int inf ,int sup, int nod)
{
    int mid=(inf+sup)/2;
    if(I <= inf && sup <= S)
        return a[nod];
    else
    {
        if(I <= mij)
            st = maxim(inf, mij, nod * 2);
        if(S >= mij)
            dr = maxim(mij + 1, sup, nod * 2 + 1);
        if(dr < st)
            return dr;
        else return st;
    }
}

void solve ()
{
    while(nrop--)
    {

    }
}

int main()
{
    read();
    solve();
    return 0;
}