Fletcher the paymaster watches over the honey farms of Buzzwell's stores of stamps. A careful computation stands between order and chaos. 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 <= 431; -100 <= a[i],x <= 1000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 431; -100 <= a[i],x <= 1000000.
