Kael runs the lighthouse at the ivory gates of Alabast. Today the books show a list of scrolls, and the numbers must be worked out before sundown. Task: Read n integers and a divisor d; print how many elements are divisible by d. Input format: First line: n and d. Second line: n space-separated integers. Output format: Print the count of elements divisible by d. Constraints: 1 <= n <= 40; 0 <= a[i] <= 1000000; 1 <= d <= 1000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 40; 0 <= a[i] <= 1000000; 1 <= d <= 1000.
