# 1-dimension Rolling Hash
# 参考 https://tjkendev.github.io/procon-library/python/string/rolling_hash.html

class RollingHash():
    def __init__(self, s, base, mod):
        self.mod = mod
        self.pw = pw = [1]*(len(s)+1)
        self.length = l = len(s)
        self.h = h = [0]*(l+1)

        v = 0
        for i in range(l): h[i+1] = v = (v * base + ord(s[i])) % mod
        v = 1
        for i in range(l): pw[i+1] = v = v * base % mod

    def get(self, l, r):
        return (self.h[r] - self.h[l] * self.pw[r-l]) % self.mod
    
    def all(self):
        return self.get(0, self.length)

base = 37; mod = 1<<61-1
S = input()
N = len(S)
M = int(input())
RHS = RollingHash(S,base,mod)
from collections import defaultdict
dic = defaultdict(lambda: 0)
for l in range(1,11):
    for i in range(N-l+1):
        dic[RHS.get(i,i+l)]+=1
ans = 0
for i in range(M):
    ans += dic[RollingHash(input(),base,mod).all()]
print(ans)