The registry keeper Opal has been asked to secure the caravan contract. On the desk lies a long table of coins readings. Task: Read n integers and a threshold t; print how many exceed t. Input format: First line: n and t. Second line: n space-separated integers. Output format: Print the count of values strictly greater than t. Constraints: 1 <= n <= 243; -1000000 <= a[i],t <= 10.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 243; -1000000 <= a[i],t <= 10.
