#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    ll n,k;
    cin>>n>>k;
    deque<ll> q;
    priority_queue<ll,vector<ll>, greater<ll>> pq;
    map<int,bool> seen;
    for (int i=0; i<k;i++){
        ll a;
        cin>>a;
        q.push_back(a);
        pq.push(a);
        seen[a]=false;
    }
    int ans=0;
    for (int i=0; i<k;i++){
        bool cnt=0;
        if (seen[q.front()]==false){
            ll most=q.front();
            seen[most]=true;
            while (seen[pq.top()]) pq.pop();
            while (!pq.empty() && pq.top()<most && !seen[pq.top()]){
                cnt=1;
                seen[pq.top()]=true;
                pq.pop();
            }
            ans+=cnt;
        }
        q.pop_front();
    }
    cout<<ans;
}