#include<bits/stdc++.h>
using namespace std;
int n,x,a[100000000];
int main(){
	cin>>n>>x;
	for(int i=1;i<=n;++i){
		cin>>a[i];
	}
	int L=0,R=n+1;
	while(R-L>1){
		int mid=(R+L)/2;
		if(a[mid]>x){
			R=mid;
		}
		else{
			L=mid;
		}
	}
	if(R==n+1){
		cout<<"Not found!";
	}
	else cout<<R<<endl<<a[R];
	return 0;
}