#include <stdio.h>
#include <stdlib.h>
 
int binary_search(int a[],int n,int x){
 
int lef, rig, mid;
lef=0;
rig=n-1;
int ret=-1;
 
while(lef<=rig){
mid=(lef+rig)/2;
if(a[mid]==x){
ret=mid;
 break;
}
if(x<a[mid])
rig = mid-1;
else lef = mid+1;
}
 return ret;
}
 
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;
}

I2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlIDxzdGRsaWIuaD4KIAppbnQgYmluYXJ5X3NlYXJjaChpbnQgYVtdLGludCBuLGludCB4KXsKCmludCBsZWYsIHJpZywgbWlkOwpsZWY9MDsKcmlnPW4tMTsKaW50IHJldD0tMTsKCndoaWxlKGxlZjw9cmlnKXsKbWlkPShsZWYrcmlnKS8yOwppZihhW21pZF09PXgpewpyZXQ9bWlkOwogYnJlYWs7Cn0KaWYoeDxhW21pZF0pCnJpZyA9IG1pZC0xOwplbHNlIGxlZiA9IG1pZCsxOwp9CiByZXR1cm4gcmV0Owp9CgppbnQgbWFpbih2b2lkKSB7CglpbnQgbix4LGk7CglpbnQgKmE7CglpbnQgYW5zID0gLTE7CglzY2FuZigiJWQgJWQiLCZuLCZ4KTsKCWEgPSAoaW50KiltYWxsb2Moc2l6ZW9mKGludCkqbik7CglpZihhPT1OVUxMKXsKCQlwcmludGYoIkVSUk9SXG4iKTsKCQlyZXR1cm4gLTE7Cgl9Cglmb3IoaT0wO2k8bjtpKyspewoJCXNjYW5mKCIlZCIsJmFbaV0pOwoJfQoJYW5zID0gYmluYXJ5X3NlYXJjaChhLG4seCk7CglpZihhbnMgIT0gLTEpIHByaW50ZigiYVslZF0gPSAlZFxuIixhbnMsYVthbnNdKTsKCWVsc2UgcHJpbnRmKCJub3QgZm91bmRcbiIpOwoJZnJlZShhKTsKCXJldHVybiAwOwp9

MTAgNgoxIDIgMyA0IDUgNiA3IDggOSAxMA==

10 6
1 2 3 4 5 6 7 8 9 10