#include <iostream>
#include <algorithm>
using namespace std;
int GetPos(int *a,int n,int x)
{
int low=0,high=n-1,mid;
while(low<=high)
{
mid=(low+high)/2;
if(a[mid]==x)return mid;
else if(a[mid]>x)high=mid-1;
else
low=mid+1;
}
return -1;
}
int main()
{
int n,i,x;
while(cin>>n>>x)
{
int *a=new int [n];
for(i=0;i<n;i++)cin>>a[i];
sort(a,a+n);
for(i=0;i<n;i++)
{
cout<<a[i];
if(i!=n-1)cout<<" ";
else
cout<<"\n";
}
cout<<GetPos(a,n,x)<<endl;
}
return 0;
}
/*
10 6
1 2 5 3 4 89 09 78 56 87
*/