#include <iostream>
#include <deque>
using namespace std;
deque<int> dict;
int count;
int main(){
    int m,n;
    cin >> m >> n;
    for(int i = 0;i < n;i++){
        int cur;
        cin >> cur;
        bool state = false;
        if(dict.size() > m) dict.pop_front();
        for(int j = 0;j < dict.size();j++){
            if(dict[j] == cur) {
                state = true;
                break;
            }
        }
        if(!state) {
            dict.push_back(cur);
            count++;
        }
    }
    cout << count;
}