def pos(cs, s)
  n = cs.size
  ret = Array.new(n, -1)
  r = 0
  sum = 0
  n.times do |l|
    while r < n && sum + cs[r] <= s
      sum += cs[r]
      r += 1
    end
    if sum == s
      ret[l] = r
    end
    sum -= cs[l]
  end
  return ret
end

n = read_line.to_i
a, b, c = read_line.split.map(&.to_i)
s = read_line.split.map { |w| w.size }
pa = pos(s, a)
pb = pos(s, a + b)
pc = pos(s, a + b + c)
puts (0...n).count { |i| pa[i] != -1 && pb[i] != -1 && pc[i] != -1 }