#include <stdio.h>
#include <stdlib.h>
 
// 線形探索（要素の個数を数える）
int linear_search(int a[], int n, int x) {
    int count = 0;
    for(int 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+CiNpbmNsdWRlIDxzdGRsaWIuaD4KCi8vIOe3muW9ouaOoue0ou+8iOimgee0oOOBruWAi+aVsOOCkuaVsOOBiOOCi++8iQppbnQgbGluZWFyX3NlYXJjaChpbnQgYVtdLCBpbnQgbiwgaW50IHgpIHsKICAgIGludCBjb3VudCA9IDA7CiAgICBmb3IoaW50IGkgPSAwOyBpIDwgbjsgaSsrKSB7CiAgICAgICAgaWYoYVtpXSA9PSB4KSB7CiAgICAgICAgICAgIGNvdW50Kys7ICAvLyDopovjgaTjgYvjgaPjgZ/jgonjgqvjgqbjg7Pjg4jjgpLlopfjgoTjgZkKICAgICAgICB9CiAgICB9CiAgICByZXR1cm4gY291bnQ7ICAvLyDopovjgaTjgYvjgaPjgZ/mlbDjgpLov5TjgZkKfQoKaW50IG1haW4odm9pZCkgewogICAgaW50IG4sIHgsIGk7CiAgICBpbnQgKmE7CiAgICBpbnQgYW5zID0gLTE7CgogICAgc2NhbmYoIiVkICVkIiwgJm4sICZ4KTsKICAgIGEgPSAoaW50KiltYWxsb2Moc2l6ZW9mKGludCkgKiBuKTsKICAgIGlmKGEgPT0gTlVMTCkgewogICAgICAgIHByaW50ZigiRVJST1JcbiIpOwogICAgICAgIHJldHVybiAtMTsKICAgIH0KCiAgICBmb3IoaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgICAgICBzY2FuZigiJWQiLCAmYVtpXSk7CiAgICB9CgogICAgYW5zID0gbGluZWFyX3NlYXJjaChhLCBuLCB4KTsKCiAgICBpZihhbnMgIT0gMCkgCiAgICAgICAgcHJpbnRmKCJGb3VuZF8lZF8lZHNcbiIsIGFucywgeCk7CiAgICBlbHNlIAogICAgICAgIHByaW50Zigibm90IGZvdW5kXG4iKTsKCiAgICBmcmVlKGEpOwogICAgcmV0dXJuIDA7Cn0KCg==

NTAgNQoxMgkzCTQJMTIJMTEJNQk3CTE1CTE4CTAJMAk1CTEwCTYJMTUJNgk0CTEwCTgJMTYJMTIJOQkxMAkxMQkxMgk5CTUJNwkxMAkxNAkzCTE3CTExCTEwCTcJMTUJNQkyCTYJMwkxOQk3CTgJMTYJMTMJMwkxOAkxMAkxOQk1

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