//第3回 課題１
#include <stdio.h>
#include <stdlib.h>
 
//この関数を実装する
int binary_search(int a[],int n,int x){
	//この関数の内側だけを書く
    int lef=0,rig=n-1,ans=-1;
    int mid;
    while(lef<=rig){
        mid=(lef+rig)/2;
        if(a[mid]==x){
            ans=mid;
            break;
        }else if(mid>x){
            rig=mid-1;
        }else{
            lef=mid+1;
        }
 
    }
    return ans;
}
 
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;
}

Ly/nrKwz5ZueIOiqsumhjO+8kQojaW5jbHVkZSA8c3RkaW8uaD4KI2luY2x1ZGUgPHN0ZGxpYi5oPgoKLy/jgZPjga7plqLmlbDjgpLlrp/oo4XjgZnjgosKaW50IGJpbmFyeV9zZWFyY2goaW50IGFbXSxpbnQgbixpbnQgeCl7CgkvL+OBk+OBrumWouaVsOOBruWGheWBtOOBoOOBkeOCkuabuOOBjwogICAgaW50IGxlZj0wLHJpZz1uLTEsYW5zPS0xOwogICAgaW50IG1pZDsKICAgIHdoaWxlKGxlZjw9cmlnKXsKICAgICAgICBtaWQ9KGxlZityaWcpLzI7CiAgICAgICAgaWYoYVttaWRdPT14KXsKICAgICAgICAgICAgYW5zPW1pZDsKICAgICAgICAgICAgYnJlYWs7CiAgICAgICAgfWVsc2UgaWYobWlkPngpewogICAgICAgICAgICByaWc9bWlkLTE7CiAgICAgICAgfWVsc2V7CiAgICAgICAgICAgIGxlZj1taWQrMTsKICAgICAgICB9CiAgICAgICAgICAgIAogICAgfQogICAgcmV0dXJuIGFuczsKfQoKaW50IG1haW4odm9pZCkgewoJaW50IG4seCxpOwoJaW50ICphOwoJaW50IGFucyA9IC0xOwoJc2NhbmYoIiVkICVkIiwmbiwmeCk7CglhID0gKGludCopbWFsbG9jKHNpemVvZihpbnQpKm4pOwoJaWYoYT09TlVMTCl7CgkJcHJpbnRmKCJFUlJPUlxuIik7CgkJcmV0dXJuIC0xOwoJfQoJZm9yKGk9MDtpPG47aSsrKXsKCQlzY2FuZigiJWQiLCZhW2ldKTsKCX0KCWFucyA9IGJpbmFyeV9zZWFyY2goYSxuLHgpOwoJaWYoYW5zICE9IC0xKSBwcmludGYoImFbJWRdID0gJWRcbiIsYW5zLGFbYW5zXSk7CgllbHNlIHByaW50Zigibm90IGZvdW5kXG4iKTsKCWZyZWUoYSk7CglyZXR1cm4gMDsKfQ==

MTAgNSAKMSAyIDMgNCA1IDYgNyA4IDkgMTA=

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