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

CiNpbmNsdWRlIDxzdGRpby5oPgojaW5jbHVkZSA8c3RkbGliLmg+CgppbnQgYmluYXJ5X3NlYXJjaChpbnQgYVtdLGludCBuLGludCB4KXsKCWludCBtaW49MDsKCWludCBtYXg9bi0xOwoJaW50IG1pZDsKCXdoaWxlKG1pbjw9bWF4KXsKCW1pZD0obWluK21heCkvMjsKCWlmKGFbbWlkXT09eCl7CglyZXR1cm4gbWlkOwoJfWVsc2UgaWYoYVttaWRdPHgpewoJbWluPW1pZCsxOwoJfWVsc2UgaWYoYVttaWRdPngpewoJbWF4PW1pZC0xOwoJfQoJfQoJcmV0dXJuIC0xOwoJfQoJCgppbnQgbWFpbih2b2lkKSB7CglpbnQgbix4LGk7CglpbnQgKmE7CglpbnQgYW5zID0gLTE7CglzY2FuZigiJWQgJWQiLCZuLCZ4KTsKCWEgPSAoaW50KiltYWxsb2Moc2l6ZW9mKGludCkqbik7CglpZihhPT1OVUxMKXsKCQlwcmludGYoIkVSUk9SXG4iKTsKCQlyZXR1cm4gLTE7Cgl9Cglmb3IoaT0wO2k8bjtpKyspewoJCXNjYW5mKCIlZCIsJmFbaV0pOwoJfQoJYW5zID0gYmluYXJ5X3NlYXJjaChhLG4seCk7CglpZihhbnMgIT0gLTEpIHByaW50ZigiYVslZF0gPSAlZFxuIixhbnMsYVthbnNdKTsKCWVsc2UgcHJpbnRmKCJub3QgZm91bmRcbiIpOwoJZnJlZShhKTsKCXJldHVybiAwOwp9Cg==

MTIgNQoxIDIgMyA0IDUgOCA5IDEzIDE2IDIxIDI1IDI3

12 5
1 2 3 4 5 8 9 13 16 21 25 27