import sys
input = sys.stdin.readline

N, M = map(int,input().split())

n_named = set()
for _ in range(N):
    name = input().rstrip()
    n_named.add(name)

m_named = set()
for _ in range(M):
    name = input().rstrip()
    m_named.add(name)

lists = list(n_named&m_named)
result = sorted(lists)

print(len(result))
for r in result:
    print(r)

import sys
input = sys.stdin.readline

N, M = map(int,input().split())

site = {}
for _ in range(N):
    name, pwd = input().split()
    site[name] = pwd
for _ in range(M):
    name = input().rstrip("\n")
    print(site[name])

import sys
input = sys.stdin.readline

numbers = [0,0]
def fibo(n):
    global numbers
    if n == 0:
        numbers[0] += 1
        return 0
    elif n == 1:
        numbers[1] += 1
        return 1
    else:
        return fibo(n-1) + fibo(n-2)

T = int(input())

for _ in range(T):
    n = int(input())
    numbers = [0,0]
    fibo(n)
    print("{} {}".format(numbers[0],numbers[1]))

import sys
input = sys.stdin.readline

def fibonacci(dp,n):
    if dp[n][0] == 0 and dp[n][1] == 0:
        dp_1 = fibonacci(dp,n-1)
        dp_2 = fibonacci(dp,n-2)
        dp[n][0] = dp_1[0] + dp_2[0]
        dp[n][1] = dp_1[1] + dp_2[1]
        return dp[n]
    else:
        return dp[n]

T = int(input())

dp = [[0,0] for _ in range(41)]
dp[0] = [1,0]
dp[1] = [0,1]
for _ in range(T):
    number = int(input())
    zero, one = fibonacci(dp,number)
    print(zero, one)

import sys
input = sys.stdin.readline
# P(6) = 1 + 2, P(1) + P(5)
# P(7) = 1 + 3, P(2) + P(6)
# P(8) = 1 + 4, P(3) + P(7)
# P(9) = 2 + 5, P(4) + P(8)
# P(10) = 2 + 7, P(5) + P(9)
# P(n) = P(n-5) + P(n-1)

T = int(input())

D = [0]*(101)
D[1] = 1
D[2] = 1
D[3] = 1
D[4] = 2
D[5] = 2

max_num = 6
for _ in range(T):
    n = int(input())
    if D[n] != 0:
        print(D[n])
    else:
        for i in range(max_num,n+1):
            D[i] = D[i-5] + D[i-1]
        max_num = n
        print(D[n])

import sys
input = sys.stdin.readline

N, M = map(int,input().split())

lists = list(map(int,input().split()))

for _ in range(M):
    i, j = map(int,input().split())
    print(sum(lists[i-1:j]))

import sys
input = sys.stdin.readline

N, M = map(int,input().split())

lists = list(map(int,input().split()))
pSum = [0]
s = 0
for l in lists:
    s += l
    pSum.append(s)

for _ in range(M):
    i, j = map(int,input().split())
    print(pSum[j]-pSum[i-1])

import sys
input = sys.stdin.readline

N = int(input())

base = "IOI"
if N == 1:
    pass
else:
    for _ in range(1,N):
        base += "OI"

M = int(input())
S = input().lstrip("O").rstrip("\n")

cnt = 0
length = len(base)
for i in range(0,len(S)):
    if len(S[i:]) > length and S[i] != "O":
        if S[i:i+length] == base:
            cnt += 1
print(cnt)

import sys
import heapq
input = sys.stdin.readline

N = int(input())
M = int(input())

graph = [[] for _ in range(N+1)]
for _ in range(M):
    start, end, cost = map(int,input().split())
    graph[start].append((end,cost))

for g in graph:
    g.sort()

start_point, end_point = map(int,input().split())

INF = int(1e9)
costs = [INF]*(N+1)
def dijkstra(start):
    q = []
    heapq.heappush(q,(0,start))
    costs[start] = 0
    while q:
        cost, now = heapq.heappop(q)
        if costs[now] < cost:
            continue
        for next, next_cost in graph[now]:
            new_cost = cost + next_cost
            if new_cost < costs[next]:
                costs[next] = new_cost
                heapq.heappush(q,(new_cost,next))


dijkstra(start_point)

print(costs[end_point])