1.0 KB | 1043 chars
import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta
SYS_INPUT = True
RECURSION_LIMIT = 10 ** 7
SET_RECURSION = False
BLANK = " "
if SET_RECURSION:
sys.setrecursionlimit(RECURSION_LIMIT)
inp = lambda : sys.stdin.readline().rstrip() if SYS_INPUT else input()
mii = lambda x = BLANK : [*map(int,inp().split(x))]
mfi = lambda x = BLANK : [*map(float,inp().split(x))]
ii = lambda : int(inp())
fi = lambda : float(inp())
isplit = lambda : inp().split()
p = print
def gcd(a, b): return gcd(b, a % b) if b > 0 else a
def lcm(a, b): return a * b // gcd(a, b)
def solve():
n, m = mii()
A = [inp() for _ in range(n)]
B = [inp() for _ in range(n)]
cnt = 0
for idx in range(m):
x = set()
y = set()
for i in A:
x.add(i[idx])
for i in B:
y.add(i[idx])
if len(x.intersection(y)) == 0:
cnt += 1
p(cnt)
if __name__ == "__main__":
tc = 1
for t in range(1, tc+1):
ret = solve()