from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right
from itertools import permutations, combinations, groupby
from heapq import heappop, heappush
import math, sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
def printl(li, sep=" "): print(sep.join(map(str, li)))
def yn(flag): print(Yes if flag else No)
_int = lambda x: int(x)-1
MOD = 998244353 #10**9+7
INF = 1<<60
Yes, No = "Yes", "No"

N = int(input())
A, B = map(int, input().split())
P = list(map(int, input().split()))

for i in range(N):
    if P[i] == 1:
        if A == 0:
            print(i+1)
            exit()
        A -= 1
    elif P[i] == 2:
        if B == 0:
            print(i+1)
            exit()
        B -= 1
    else:
        if A == 0 or B == 0:
            print(i+1)
            exit()
        A -= 1
        B -= 1
print(-1)