#include <bits/stdc++.h>

using namespace std;

int main() {
    long long n, k;
    cin >> n >> k;
    
    vector<long long> szamok;
    
    priority_queue<long long> sor;
    
    for (long long i = 0; k > i; i++) {
        long long szam;
        cin >> szam;
        
        szamok.push_back(szam);
        sor.push(szam * -1);
    }
    
    long long pontszam = 0;
    for (long long i = 0; k > i; i++) {
        bool good = false;
        
        while (!sor.empty()) {
            long long current = sor.top()*-1;
            
            if (current <= szamok[i]) {
                sor.pop();
            } else {
                break;
            }
            if (current < szamok[i]) {
                good = true;
            }
        }
        
        if (good) {
            pontszam++;
        }
    }
    
    cout << pontszam << endl;

    return 0;
}