from bisect import bisect_left
BCD = list(map(int,input().split()))
N = int(input())
E = list(map(int,input().split()))
E.sort()
BCD.sort()
B,C,D = BCD
b = bisect_left(E,B)
if B == C:
    c = b + 1
else:
    c = bisect_left(E,C)
if C == D:
    d = c + 1
else:
    d = bisect_left(E,D)
ans = 0
for i in range(d,N):
    for j in range(c,i):
        for k in range(b,j):
            ans += pow(2,k)
print(ans)