#!/usr/bin/env pypy3


def str2array(s):
    assert s.islower() or s.isupper()
    s = s.lower()
    a = ord("a")
    return [ord(c) - a for c in s]


# 参考：『アルゴリズムイントロダクション』（第3版）pp.823-827
def rabin_karp_matcher(text, pattern, q=1000000007):
    D = 26
    txt = str2array(text)
    ptn = str2array(pattern)
    n = len(txt)
    m = len(ptn)
    if n < m:
        return
    h = pow(D, m - 1, q)
    p = 0
    t = 0
    for i in range(m):
        p = (D * p + ptn[i]) % q
        t = (D * t + txt[i]) % q
    for s in range(n - m + 1):
        if p == t and ptn[:m] == txt[s:s + m]:
            yield s
        if s < n - m:
            t = (D * (t - txt[s] * h) + txt[s + m]) % q


def main():
    s = input()
    m = int(input())
    cs = [input() for _ in range(m)]
    ans = sum(len(list(rabin_karp_matcher(s, c))) for c in cs)
    print(ans)


if __name__ == '__main__':
    main()