#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+CiNpbmNsdWRlIDxzdGRsaWIuaD4KIAovL+OBk+OBrumWouaVsOOCkuWun+ijheOBmeOCiwppbnQgYmluYXJ5X3NlYXJjaChpbnQgYVtdLGludCBuLGludCB4KXsKCmludCBsZWYsIHJpZywgbWlkOwpsZWY9MDsKcmlnPW4tMTsKaW50IHJldD0tMTsKCndoaWxlKGxlZjw9cmlnKXsKbWlkPShsZWYrcmlnKS8yOwppZihhW21pZF09PXgpewpyZXQ9bWlkOwogYnJlYWs7Cn0KaWYoeDxhW21pZF0pCnJpZyA9IG1pZC0xOwplbHNlIGxlZiA9IG1pZCsxOwp9CiByZXR1cm4gcmV0Owp9CgoKCS8v44GT44Gu6Zai5pWw44Gu5YaF5YG044Gg44GR44KS5pu444GPCgogCmludCBtYWluKHZvaWQpIHsKCWludCBuLHgsaTsKCWludCAqYTsKCWludCBhbnMgPSAtMTsKCXNjYW5mKCIlZCAlZCIsJm4sJngpOwoJYSA9IChpbnQqKW1hbGxvYyhzaXplb2YoaW50KSpuKTsKCWlmKGE9PU5VTEwpewoJCXByaW50ZigiRVJST1JcbiIpOwoJCXJldHVybiAtMTsKCX0KCWZvcihpPTA7aTxuO2krKyl7CgkJc2NhbmYoIiVkIiwmYVtpXSk7Cgl9CglhbnMgPSBiaW5hcnlfc2VhcmNoKGEsbix4KTsKCWlmKGFucyAhPSAtMSkgcHJpbnRmKCJhWyVkXSA9ICVkXG4iLGFucyxhW2Fuc10pOwoJZWxzZSBwcmludGYoIm5vdCBmb3VuZFxuIik7CglmcmVlKGEpOwoJcmV0dXJuIDA7Cn0KIA==

MTAgNwoxIDIgMyA0IDUgNiA3IDggOSAxMA==

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