#include <bits/stdc++.h>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
unordered_map <int, int> fr;
int main()
{
    int i, x, n, k;
    fin >> n >> k;
    for (i = 1; i <= n; i++)
    {
        fin >> x;
        fr[x]++;
    }
    i = 0;
    int gasit = 0;
    while (!gasit)
    {
        i++;
        fr[i] += fr[i - 1];
        if (fr[i] == k)gasit = 1;
    }
    fout << i;
    return 0;
}