import re

# Read the novel text
s = input()

# Read the number of known words
n = int(input())

# Read the known words and store them in a set (case-insensitive)
vis = set()
if n > 0:
    known_words_line = input().strip().split()
    for word in known_words_line:
        vis.add(word.lower())

# Extract words from the novel text using regular expressions
# Words are sequences of alphabetic characters (letters only)
words = re.findall(r'[A-Za-z]+', s)

# Initialize the lookup counter
ans = 0

# Process each word in the novel text
for word in words:
    # Convert the word to lowercase for case-insensitive comparison
    word_lower = word.lower()
    # If the word is not in the known words, count it and add to known words
    if word_lower not in vis:
        vis.add(word_lower)
        ans += 1

# Output the number of times Xiao Xing needs to look up words
print(ans)