import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
md = 10**9+7
# md = 998244353

from collections import Counter

def pack(ss):
    res = 0
    for s in ss[::-1]: res = res*5+s
    return res

def unpack(a):
    res = []
    while a:
        a, r = divmod(a, 5)
        res.append(r)
    res += [0]*(k-len(res))
    return res

n, k = LI()
tt = [0]*(5**k)
ss = []
for _ in range(n):
    s = pack([int(c) for c in SI()])
    tt[s] = 1
    ss.append(s)

for i in range(k):
    for s in range(5**k)[::-1]:
        if tt[s] == 0: continue
        dd = unpack(s)
        if dd[i] == 0: continue
        dd[i] -= 1
        ns = pack(dd)
        tt[ns] += tt[s]

ans = 0
for s in ss:
    if tt[s] > 1: ans += 1

print(ans)