def solve(S, Cs):
    counts = {}
    for i in range(1, 11):
        for k in range(0, len(S)):
            if k + i > len(S): continue

            counts.setdefault(S[k:k+i], 0)
            counts[S[k:k+i]] += 1

    sum = 0
    for C in Cs:
        if C in counts:
            sum += counts[C]
    return sum

if __name__ == "__main__":
    S = input()
    M = int(input())
    print(solve(S, [input() for _ in range(0, M)]))