#include <stdio.h>
#include <stdlib.h>
//線形探索
int linear_search(int a[],int n,int x){
    int count = 0;
    int i;
 
    for(i = 0; i < n; i++){
        if(a[i] == x){
            count++;
        }
    }
 
    return count;   // 見つかった個数を返す
}
 
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+CiNpbmNsdWRlIDxzdGRsaWIuaD4KLy/nt5rlvaLmjqLntKIKaW50IGxpbmVhcl9zZWFyY2goaW50IGFbXSxpbnQgbixpbnQgeCl7CiAgICBpbnQgY291bnQgPSAwOwogICAgaW50IGk7CgogICAgZm9yKGkgPSAwOyBpIDwgbjsgaSsrKXsKICAgICAgICBpZihhW2ldID09IHgpewogICAgICAgICAgICBjb3VudCsrOwogICAgICAgIH0KICAgIH0KCiAgICByZXR1cm4gY291bnQ7ICAgLy8g6KaL44Gk44GL44Gj44Gf5YCL5pWw44KS6L+U44GZCn0KCmludCBtYWluKHZvaWQpIHsKICAgIGludCBuLHgsaTsKICAgIGludCAqYTsKICAgIGludCBhbnMgPSAtMTsKICAgIHNjYW5mKCIlZCAlZCIsJm4sJngpOwogICAgYSA9IChpbnQqKW1hbGxvYyhzaXplb2YoaW50KSpuKTsKICAgIGlmKGE9PU5VTEwpewogICAgICAgIHByaW50ZigiRVJST1JcbiIpOwogICAgICAgIHJldHVybiAtMTsKICAgIH0KICAgIGZvcihpPTA7aTxuO2krKyl7CiAgICAgICAgc2NhbmYoIiVkIiwmYVtpXSk7CiAgICB9CiAgICBhbnMgPSBsaW5lYXJfc2VhcmNoKGEsbix4KTsKICAgIGlmKGFucyAhPSAwKSBwcmludGYoIkZvdW5kXyVkXyVkc1xuIixhbnMseCk7CiAgICBlbHNlIHByaW50Zigibm90IGZvdW5kXG4iKTsKICAgIGZyZWUoYSk7CiAgICByZXR1cm4gMDsKfQoK

NTAgNQoxMgkzCTQJMTIJMTEJNQk3CTE1CTE4CTAJMAk1CTEwCTYJMTUJNgk0CTEwCTgJMTYJMTIJOQkxMAkxMQkxMgk5CTUJNwkxMAkxNAkzCTE3CTExCTEwCTcJMTUJNQkyCTYJMwkxOQk3CTgJMTYJMTMJMwkxOAkxMAkxOQk1Cg==

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