#include <bits/stdc++.h>
using namespace std;
#define int long long
#define F(i,l,r) for(int i=(l);i<=(r);i++)
#define D(i,l,r) for(int i=(l);i>=(r);i--)
const int N=6e5+5,inf=1e9;
int n,k,w[N],p[N],lst[N],nxt[N],r1,r2,res,ans;
vector<int>st,g1[N],g2[N];
signed main(){
    #ifdef zzafanti
    freopen("in.txt","r",stdin);
    #endif
    #ifdef orz
    freopen("out.txt","w",stdout);
    #endif
    cin>>n>>k;
    F(i,1,n)cin>>w[i],w[i+n]=w[i];
    w[0]=w[2*n+1]=inf;
    st.push_back(0);
    F(i,1,2*n){
        while(w[st.back()]<w[i])st.pop_back();
        lst[i]=st.back();
        st.push_back(i);
    }
    st.clear();
    st.push_back(2*n+1);
    D(i,2*n,1){
        while(w[st.back()]<w[i])st.pop_back();
        nxt[i]=st.back();
        st.push_back(i);
      //  cout<<i<<"nxt"<<nxt[i]<<endl;
    }
    F(i,1,2*n)g1[lst[i]].push_back(i),g2[nxt[i]].push_back(i);
    F(i,1,n){
        if(lst[i]<1)r1++;
        r2++;
        r2-=g2[i].size();
    }
    F(i,n+1,2*n){
        r2++;
        for(auto j:g2[i])r2-=j>=i-n;
        r1+=lst[i]<i-n;r1--;
        for(auto j:g1[i-n])r1+=j<=i;
        if(max(r1,r2)>res){
            res=max(r1,r2);
            ans=i;
        }
    }
    cout<<res<<endl;
    cerr<<ans;
}