import bisect
bcd = sorted(map(int, input().split()))
n = int(input())
E = sorted(map(int, input().split()))

dp = [0] * 8
dp[0] = 1
for e in E:
    newDP = dp[:]
    b = bisect.bisect_right(bcd, e)
    if b == 0:
        newDP = [x * 2 for x in dp]
    elif b == 1:
        for bit in range(8):
            if bit & 1:
                newDP[bit] += dp[bit]
                newDP[bit] += dp[bit ^ 1]
    elif b == 2:
        newDP[2] += dp[0]
        newDP[3] += dp[1] + dp[2] + dp[3]
        newDP[6] += dp[4]
        newDP[7] += dp[5] + dp[6] + dp[7]
    else:
        newDP[4] += dp[0]
        newDP[5] += dp[1]
        newDP[6] += dp[2] + dp[4]
        newDP[7] += dp[3] + dp[5] + dp[6] + dp[7]
    dp = newDP

print(dp[7])