import bisect

def main():
    N = int(input())
    a,b,c = map(int,input().split())
    S = list(map(str,input().split()))
    cumsum = [0]
    for i in range(N):
        temp = cumsum[-1] + len(S[i])
        cumsum.append(temp)
    #print(cumsum)
    r = 0
    ans = 0

    for l in range(N):
        while r < N and cumsum[r] - cumsum[l] < a+b+c:
            r += 1
        if cumsum[r] - cumsum[l] == a+b+c:
            ok = r
            ng = l
            while abs(ok-ng) > 1:
                mid = (ok+ng)//2
                if cumsum[mid] - cumsum[l] >= a:
                    ok = mid
                else:
                    ng = mid
            
            if cumsum[ok] - cumsum[l] != a:
                continue 
            #print(l,r,mid)

            ok = l
            ng = r
            while abs(ok-ng) > 1:
                mid = (ok+ng)//2
                if cumsum[r] - cumsum[mid] >= c:
                    ok = mid
                else:
                    ng = mid
            #print("2",l,r,mid)
            if cumsum[r] - cumsum[ok] != c:
                continue
            ans += 1
        if l == r:
            r += 1
    print(ans)


if __name__ == '__main__':
    main()