#include <bits/stdc++.h>

using namespace std;
int v[16000],n;
ifstream in ("transport.in");
ofstream out ("transport.out");
int cautb (int val)
{
    int pos=0;
    for(int msk=1<<20; msk>0 ; msk/=2)
        if(pos+msk<n && v[pos+msk]<=val)
            pos+=msk;
    return pos;
}
int main()
{
    int k,i;
    in>>n>>k;
    for(i=1; i<=n; i++)
    {
        in>>v[i];
    }
    sort(v+1,v+n+1);
out<<v[n]+1;
}