467B - Fedor and New Game - CodeForces Solution

n,m,k = map(int,input().split())
x = [int(input()) for _ in range(m+1)]
count = 0
for i in range(m):
    diff = x[i]^x[m]
    diff = str(bin(diff))
    diff_ones = 0
    for j in range(len(diff)):
        if diff[j]=='1':
            diff_ones+=1

    if diff_ones <=k:
        count+=1
print(count)