生成讲解视频---**Question Description:** Lanqiao Academy organized a summer outing to an amusement park, with a total of N students participating. Each student has an ability value, where the ability value of the i-th student is v_i. In the amusement park, students need to challenge a Demon King with K HP. Xiaolan, as the class monitor, is responsible for assigning teams to each student. Each student must belong to one and only one team. Each team will challenge the Demon King once. The team's ability value is defined as the number of students in the team multiplied by the ability value of the student with the minimum ability value in that team. If the team's ability value is greater than or equal to K, then the team can defeat the Demon King. Xiaolan hopes to form as many teams as possible to defeat the Demon King. Please help Xiaolan calculate the maximum number of teams that can defeat the Demon King. **Input Format:** The first line contains two positive integers N and K (1 <= N <= 10^5, 1 <= K <= 10^9), representing the number of students and the Demon King's HP, respectively. The second line contains N integers v1, v2, ..., vN (1 <= v_i <= 10^9), representing the ability values of each student. **Output Format:** Output a single integer, representing the maximum number of teams that can defeat the Demon King.