Every season at the kelp forests of Tangledeep, someone must certify the cargo before shipping. This year the task falls to Yusuf, armed only with the ingots register. Task: Read n integers and a target x; print how many times x occurs. Input format: First line: n and x. Second line: n space-separated integers. Output format: Print the number of occurrences of x. Constraints: 1 <= n <= 619; -1000000 <= a[i],x <= 10.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 619; -1000000 <= a[i],x <= 10.
