#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream f("cmmdc.in");
ofstream g("cmmdc.out");
int v[1001];
int main()
{
    int n,i,nr,ok=0,mij,a,b;
    f>>n>>nr;
    a=1;
    b=n;
    mij=(a+b)/2;
    for (i=1;i<=n;i++)
    {
        f>>v[i];
    }
    sort (v,v+n);
    while (v[mij]!=nr)
    {
        mij=(a+b)/2;
        if (nr>v[mij])
        {
            a=mij+1;
        }
        else b=mij;
    }
    g<<mij;
    return 0;
}