#include int revlst(int lst[], int a, int b) { a = a-1; b = b-1; while(a

#include int main() { int n, m; int a, b; scanf("%d %d", &n, &m); int lst[n]; for (int i = 0; i

#include int main() { int n,m,v=0; int j,k; scanf("%d %d", &n, &m); int lst[n]; for (int i = 0; i

a, b = map(list, input().split()) cnt = 0 lst = [] for i in range(len(b)-len(a)+1): cnt = 0 for j in range(len(a)): if a[j] != b[i + j]: cnt += 1 lst.append(cnt) answer = min(lst) #print(lst) print(answer)

n, m = map(int, input().split()) lst = [] temp = [] ans = dict() for i in range(n): item = input() ans[item] = 0 for j in range(m): lst.append(input()) for i in range(len(lst)): if lst[i] in ans.keys(): ans[lst[i]] += 1 print(sum(ans.values()))

n, m = map(int, input().split()) lst = [] temp = [] ans = dict() for i in range(n+m): lst.append(input()) for i in range(len(lst)): if lst[i] in ans: ans[lst[i]] += 1 else: ans[lst[i]] = 1 temp = sorted([key for key, value in ans.items() if value != 1]) print(len(temp)) print(*temp,sep='\n')