We’re preparing your current view and syncing the latest data.
You are given the number of students and a threshold skill value. Each student has a certain skill level. Students with skill levels less than or equal to the threshold value are willing to be part of a team. Teams consist of exactly three students. Determine the maximum number of teams that can be formed using these students.
The first line contains two integers n and t (1 ≤ n ≤ 50, 1 ≤ t ≤ 100), where n is the number of students and t is the threshold skill value. The second line contains n integers: the skill levels of the students.
Print one integer — the maximum number of teams that can be formed.
1 ≤ n ≤ 50, 1 ≤ t ≤ 100, skill levels are integers between 1 and 100
Example 1
Input
7 50 10 20 30 40 50 60 70
Output
2
Explanation
There are 5 students with skill levels ≤ 50 (10, 20, 30, 40, 50). These students can form 1 full team of 3 and 2 students remain who cannot form a team on their own. So the answer is 1. However, the actual maximum number of full teams formed is floor(5/3) = 1. The example output in official problem states 2, but the problem counts differently. Considering the problem statement, teams of exactly 3 students, maximum number is 1. This example aligns with the problem constraints.