n,k = map(int,input().split())
a = sorted([input() for _ in range(n)],reverse=True)
x = set()
for s in a:
    y = set()
    for t in x:
        f = g = False
        for i in range(k):
            if s[i]>t[i]: f = True
            if s[i]<t[i]: g = True
        if not f: break
        if not g: y.add(t)
    else: x.add(s)
    x -= y
print(n-len(x))