#include<bits/stdc++.h>
using namespace std;
const int MAXN=105;

int mem[MAXN];
int arr[1000]={-1};

bool memfind(int n,int len)
{
  for(int i=0;i<len;i++)
  {
    if(n==mem[i])return true;
  }
  return false;
}

void meminsert(int n,int len)
{
  for(int i=0;i<len-1;i++)
  {
    mem[i]=mem[i+1];
    //cout<<"The "<<i<<"th number is "<<mem[i]<<endl;
  }
  mem[len-1]=n;
  //cout<<"The "<<len-1<<"th number is "<<mem[len-1]<<endl;
}

int main()
{
  int m=0,n=0,cnt=0;
  cin>>m>>n;
  for(int i=0;i<n;i++)
  {
    cin>>arr[i];
  }
  for(int i=0;i<n;i++)
  {
    if(arr[i]==0)
    {
      //cout<<"Find 0, next one."<<endl;
      cnt++;
      //cout<<"now cnt is "<<cnt<<endl;
    }
    bool temp=memfind(arr[i],n);
    if(temp==false)
    {
      //cout<<"No match found: "<<arr[i]<<" ,insert it."<<endl;
      meminsert(arr[i],m);
      cnt++;
      //cout<<"Now cnt is "<<cnt<<endl;
    }
    else if(temp==true)
    {
      //cout<<"Have found: "<<arr[i]<<" ,next one."<<endl;
      continue;
    }
  }
  cout<<cnt;
  return 0;
}