#aising2019b. [aising2019_b]Contests

[aising2019_b]Contests

Problem Statement

You have written NN problems to hold programming contests. The ii-th problem will have a score of PiP_i points if used in a contest.

With these problems, you would like to hold as many contests as possible under the following condition:

  • A contest has three problems. The first problem has a score not greater than AA points, the second has a score between A+1A + 1 and BB points (inclusive), and the third has a score not less than B+1B + 1 points.

The same problem should not be used in multiple contests. At most how many contests can be held?

Constraints

  • 3leqNleq1003 \\leq N \\leq 100
  • 1leqPileq201 \\leq P_i \\leq 20 (1leqileqN1 \\leq i \\leq N)
  • 1leqA<B<201 \\leq A < B < 20
  • All values in input are integers.

Input

Input is given from Standard Input in the following format:

NN AA BB P1P_1 P2P_2 ...... PNP_N

Output

Print the answer.


Sample Input 1

7
5 15
1 10 16 2 7 20 12

Sample Output 1

2

Two contests can be held by putting the first, second, third problems and the fourth, fifth, sixth problems together.


Sample Input 2

8
3 8
5 5 5 10 10 10 15 20

Sample Output 2

0

No contest can be held, because there is no problem with a score of A=3A = 3 or less.


Sample Input 3

3
5 6
5 6 10

Sample Output 3

1