#include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
using namespace std;
#define ll long long
int main()
{
    cin.tie(nullptr);
    cout.tie(nullptr);
    ios_base::sync_with_stdio(false);

    ll n,k;
    cin>>n>>k;
    vector<ll>vec(k);
    deque<int>q;
    for(ll i = 0; i < k; i++)
    {
        cin>>vec[i];
        q.push_front(vec[i]);
    } 
    sort(q.begin(), q.end());

    ll db = 0;
    for(ll i = 0; i < k; i++)
    {
        if(!q.empty() && q.front() < vec[i])
        {
            while (!q.empty() && q.front() <= vec[i]) q.pop_front();
            db++;
        }
        else if(!q.empty() && q.front() == vec[i]) q.pop_front();
    }
    cout<<db<<"\n";
}
/*
25 7
1 8 3 15 4 20 16
*/