import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken().to!int; }
long readLong() { return readToken().to!long; }
real readReal() { return readToken().to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


int N;
int A, B;
int[] P;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      A = readInt();
      B = readInt();
      P = new int[N];
      foreach (i; 0 .. N) {
        P[i] = readInt();
      }
      const cnt1 = P.count!(p => (p <= A));
      const cnt2 = P.count!(p => (A + 1 <= p && p <= B));
      const cnt3 = P.count!(p => (B + 1 <= p));
      assert(cnt1 + cnt2 + cnt3 == N);
      writeln(min(cnt1, cnt2, cnt3));
    }
  } catch (EOFException e) {
  }
}
