The inventory keeper Leon has been asked to recover the missing manifest. On the desk lies a long table of parcels readings. 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 <= 43; -1000000 <= a[i],x <= 1000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 43; -1000000 <= a[i],x <= 1000000.
