#include <stdio.h>
#include <stdlib.h>
 
//線形探索
int linear_search(int a[],int n,int x){
	int i, m=0;
	for(i=0;i<n;i++){
		if(a[i]==x){
		m=m+1;
		}
	}
	return m;
}
 
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 = linear_search(a,n,x);
	if(ans != 0) printf("Found_%d_%ds\n",ans,x);
	else printf("not found\n");
	free(a);
	return 0;
}
 

I2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlIDxzdGRsaWIuaD4KIAovL+e3muW9ouaOoue0ogppbnQgbGluZWFyX3NlYXJjaChpbnQgYVtdLGludCBuLGludCB4KXsKCWludCBpLCBtPTA7Cglmb3IoaT0wO2k8bjtpKyspewoJCWlmKGFbaV09PXgpewoJCW09bSsxOwoJCX0KCX0KCXJldHVybiBtOwp9CiAKaW50IG1haW4odm9pZCkgewoJaW50IG4seCxpOwoJaW50ICphOwoJaW50IGFucyA9IC0xOwoJc2NhbmYoIiVkICVkIiwmbiwmeCk7CglhID0gKGludCopbWFsbG9jKHNpemVvZihpbnQpKm4pOwoJaWYoYT09TlVMTCl7CgkJcHJpbnRmKCJFUlJPUlxuIik7CgkJcmV0dXJuIC0xOwoJfQoJZm9yKGk9MDtpPG47aSsrKXsKCQlzY2FuZigiJWQiLCZhW2ldKTsKCX0KCWFucyA9IGxpbmVhcl9zZWFyY2goYSxuLHgpOwoJaWYoYW5zICE9IDApIHByaW50ZigiRm91bmRfJWRfJWRzXG4iLGFucyx4KTsKCWVsc2UgcHJpbnRmKCJub3QgZm91bmRcbiIpOwoJZnJlZShhKTsKCXJldHVybiAwOwp9CiA=

NTAgNQoxMiAzCTQgMTIJMTEgNQk3CTE1CTE4CTAJMAk1CTEwCTYJMTUJNgk0CTEwCTgJMTYJMTIJOQkxMAkxMQkxMgk5CTUJNwkxMAkxNAkzCTE3CTExCTEwCTcJMTUJNQkyCTYJMwkxOQk3CTgJMTYJMTMJMwkxOAkxMAkxOQk1

50 5
12 3	4 12	11 5	7	15	18	0	0	5	10	6	15	6	4	10	8	16	12	9	10	11	12	9	5	7	10	14	3	17	11	10	7	15	5	2	6	3	19	7	8	16	13	3	18	10	19	5