Count Special Numbers

You are given an integer n, an integer m, and a sequence of n integers. Your task is to compute the number of integers between 1 and the maximum element in the sequence that are divisible by m. In other words, if \( M = \max(sequence) \), then you need to calculate \( \lfloor \frac{M}{m} \rfloor \).

Note: The number n represents the size of the sequence.

inputFormat

The first line contains two space-separated integers n and m.

The second line contains n space-separated integers representing the sequence.

outputFormat

Output a single integer, which is the count of numbers between 1 and the maximum number in the sequence that are divisible by m.

5 3
2 5 9 12 15

5