1

#include <bits/stdc++.h>
using namespace std;
int f[1010];  
int m, n;
int a;
int head = 0;  
int size = 0;  
int cnt = 0;   

// 检查元素是否在缓存中
bool check(int k) {
    for (int i = 0; i < size; i++) { 
        if (f[i] == k) {
            return true;
        }
    }
    return false;
}

int main() {
    cin >> m >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a;
        if (!check(a)) {  
            cnt++;
            if (size < m) {  
                f[size] = a;
                size++;
            } else {  
                f[head] = a;
                head = (head + 1) % m;  
            }
        }
    }
    cout << cnt << endl;
    return 0;
}