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 C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Linq;

namespace AISB
{
    static class MainClass
    {

        public static void Main(string[] args)
        {
            int N = int.Parse(Console.ReadLine());
            string[] input1 = Console.ReadLine().Split(' ');
            int A = int.Parse(input1[0]);
            int B = int.Parse(input1[1]);
            string[] input2 = Console.ReadLine().Split(' ');
            List<int> plst = new List<int>();
            var p1lst = new List<int>();
            var p2lst = new List<int>();
            var p3lst = new List<int>();

            for (int i = 0; i < N; i++)
            {
                int p = int.Parse(input2[i]);
                plst.Add(p);
                if (p <= A)
                {
                    p1lst.Add(p);
                }
                else if (p >= A + 1 && p <= B)
                {
                    p2lst.Add(p);
                }
                else
                {
                    p3lst.Add(p);
                }
            }
            int ans = 0;
            ans = Math.Min(p1lst.Count(), p2lst.Count);
            ans = Math.Min(ans, p3lst.Count());

            Console.WriteLine(ans);

            return;


        }



        public static long Gcd(long a, long b)
        {
            long tmp;
            // a<bにする
            if (a >= b)
            {
                tmp = a;
                a = b;
                b = tmp;
            }

            if (a == 0)
            {
                return b;
            }

            tmp = a;
            a = b % a;
            b = tmp;
            return Gcd(a, b);

        }


        public static IEnumerable<long> PF(long n)
        {
            long i = 2;
            long tmp = n;

            while (i * i <= n) //※1
            {
                if (tmp % i == 0)
                {
                    tmp /= i;
                    yield return i;
                }
                else
                {
                    i++;
                }
            }
            if (tmp != 1) yield return tmp;//最後の素数も返す
        }




    }

}