#include <iostream>
#include <cstring>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("cool.in");
ofstream g("cool.out");

long long p,n,k,i,j,ok,nr;
long long v[5001],b[1001],a[1001];
int main()
{
    f>>p;
    f>>n>>k;
    for(i=1;i<=n;i++)f>>v[i];
    if(p==1)
    {
        for(j=1;j<=k;j++)b[j]=v[j];
        sort(b+1,b+k+1);
        for(j=1;j<k;j++)if(b[j+1]!=b[j]+1)ok=1;
        if(ok==0)g<<b[k];
        else {for(i=1;i<=k;i++){a[v[i]]++;}
                for(i=1;i<=k;i++)if(a[v[i]]==1)nr++;
                g<<nr;}
    }


    return 0;
}