Problem:
Score : 200 points

Problem Statement

You have written N problems to hold programming contests.
The i-th problem will have a score of P_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 A points, the second has a score between A + 1 and B points (inclusive), and the third has a score not less than B + 1 points.

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

Constraints

3 \leq N \leq 100

1 \leq P_i \leq 20 (1 \leq i \leq N)

1 \leq A < B < 20

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A B
P_1 P_2 ... P_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 = 3 or less.

Sample Input 3

3
5 6
5 6 10

Sample Output 3

1

Solution in Common Lisp (SBCL 1.1.14) (judge verdict: Accepted)

(defun split (line)
  (with-input-from-string (stream line)
    (loop for obj = (read stream nil)
          while obj
          collect obj)))

(let* ((n (read))
       (ab (split (read-line)))
       (a (car ab))
       (b (cadr ab))
       (p (split (read-line))))
  (princ (min (count-if (lambda (x) (<= x a)) p)
              (count-if (lambda (x) (and (> x a) (<= x b))) p)
              (count-if (lambda (x) (>  x b)) p))))