#include <stdio.h>
#include <stdlib.h>
 
//この関数を実装する
int binary_search(int a[],int n,int x){
	//この関数の内側だけを書く
	int lef,rig,mid;
	lef=a[0];
	rig=a[n-1];
	mid=(lef+rig)/2;
	for(int i=0;i<n;i++){
		if(x>mid){
			lef=mid+1;
			mid=(lef+rig)/2;
		}else if(x<mid){
			rig=mid-1;
			mid=(lef+rig)/2;
		}else if(mid==x){
			break;
		}else if(lef>rig){
			return -1;
		}
	}
	for(int i=0;i<n;i++){
		if(a[i]==mid){
			return i;
		}
	}
}
 
int main(void) {
	int n,x,i;
	int *a;
	int ans = -1;
	scanf("%d %d",&n,&x);
	a = (int*)malloc(sizeof(int)*n);
	if(a==NULL){
		printf("ERROR\n");
		return -1;
	}
	for(i=0;i<n;i++){
		scanf("%d",&a[i]);
	}
	ans = binary_search(a,n,x);
	if(ans != -1) printf("a[%d] = %d\n",ans,a[ans]);
	else printf("not found\n");
	free(a);
	return 0;
}