a = []
n , k = map(str,input().split())
k = int(k)
n = list(map(str,n))
d = 1
for i in range(k):
    a.append(list(map(str,input().split())))
def dfs(a,n,i):
    global d
    if i < k:
        for j in range(len(n)):
            if n[j] == a[i][0]:
                c = n[j]
                n[j] = a[i][1]
                d += 1
                dfs(a,n,i+1)
                n[j] = c
                dfs(a,n,i+1)


dfs(a,n,0)
print(d)