local bls, brs = bit.lshift, bit.rshift
local mfl = math.floor

local function comp(a, b)
  return a < b
end

local function lower_bound(ary, x)
  local num = #ary
  if num == 0 then return 1 end
  if not comp(ary[1], x) then return 1 end
  if comp(ary[num], x) then return num + 1 end
  local min, max = 1, num
  while 1 < max - min do
    local mid = mfl((min + max) / 2)
    if comp(ary[mid], x) then
      min = mid
    else
      max = mid
    end
  end
  return max
end

local t = {io.read("*n", "*n", "*n")}
local n = io.read("*n")
local e = {}
for i = 1, n do
  e[i] = io.read("*n")
end
table.sort(t)
table.sort(e)
local lb = {}
for i = 1, 3 do
  lb[i] = lower_bound(e, t[i])
end
local ret = bls(1, n)
ret = ret - bls(1, lb[3] - 1)
if lb[3] <= n then
  local v1 = n + 1 - lb[3]
  local v2 = bls(1, lb[2] - 1)
  ret = ret - v1 * v2
  if lb[2] <= n - 1 then
    local w1 = mfl((n + 1 - lb[3]) * (n - lb[3]) / 2) + (n + 1 - lb[3]) * (lb[3] - lb[2])
    local w2 = bls(1, lb[1] - 1)
    ret = ret - w1 * w2
  end
end
print(ret)