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

MTIgNSAKMSAyIDMgNCA1IDggOSAxMCAyMyA0MCA1NSA5MA==

12 5 
1 2 3 4 5 8 9 10 23 40 55 90