#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;
    vector<ll> q;
    priority_queue<ll,vector<ll>, greater<ll>> pq;
    for (int i=0; i<k;i++){
        ll a;
        cin>>a;
        q.push_back(a);
        pq.push(a);
    }
    int ans=0;
    for (int i=0; i<k;i++){
        bool cnt=0;
        ll most=q[i];
        while (!pq.empty() && pq.top()<most && pq.top()!=q[i]){
            cnt=1;
            pq.pop();
        }
        if (pq.top()==q[i]) pq.pop();
        ans+=cnt;
    }
    cout<<ans;
}