#include<iostream>
#include<queue>
using namespace std;

int main(){
    int m, n,nub;
    int time = 0;
    int z = 0;
    cin >> m >> n;
    queue<int> q;
    for (int i = 0; i < n;i++){
        cin >> nub;
        for (int j = 1; j <= m;j++){
            z = q.size();
            if(q.front()==nub){
                break;
            }else if(q.front()!=nub){
                q.push(q.front());
                q.pop();
            }
            if(j>=z){
                time++;
                if(z==m){
                    q.pop();
                    q.push(nub);
                }else if(z<m){
                    q.push(nub);
                }
                break;
            }
        }
    }
    cout << time << endl;
    return 0;
}