from collections import defaultdict

S = input()
N = len(S)
M = int(input())

base = 1007
mod = 2**61-1

hash = [0]*(N+1)
power = [1]*(N+1)
for i in range(1,N+1):
    hash[i] = (hash[i-1]*base + ord(S[i-1])) %mod
    power[i] = power[i-1]*base %mod

def RollingHash(l,r):
    return hash[r] - hash[l]*power[r-l]%mod


base2 = 2009
mod2 = 10**9+9

hash2 = [0]*(N+1)
power2 = [1]*(N+1)
for i in range(1,N+1):
    hash2[i] = (hash2[i-1]*base2 + ord(S[i-1])) %mod2
    power2[i] = power2[i-1]*base2 %mod2

def RollingHash2(l,r):
    return hash2[r] - hash2[l]*power2[r-l]%mod2

possible = [defaultdict(int) for _ in range(11)]
for i in range(10):
    for j in range(N+1-i):
        possible[i][(RollingHash(j,j+i),RollingHash2(j,j+i))] += 1



ans = 0
for i in range(M):
    C = input()
    hashC = 0
    hashC2 = 0
    for i in range(len(C)):
        hashC += ord(C[i])*base**(len(C)-1-i) %mod
        hashC %= mod
        hashC2 += ord(C[i])*base2**(len(C)-1-i) %mod2
        hashC2 %= mod2
    #if possible[len(C)][hashC] == possible2[len(C)][hashC]:
    ans += possible[len(C)][(hashC,hashC2)]
    #print(hashC)
    
print(ans)