B"After you had helped George and Alex to move in the dorm, they went to help their friend Fedor play a new computer game xc2 xabCall of Soldiers 3 xc2 xbb. The game has (m xe2 x80 x89+ xe2 x80 x891) players and n types of soldiers in total. Players xc2 xabCall of Soldiers 3 xc2 xbb are numbered form 1 to (m xe2 x80 x89+ xe2 x80 x891). Types of soldiers are numbered from 0 to n xe2 x80 x89- xe2 x80 x891. Each player has an army. Army of the i-th player can be described by non-negative integer xi. Consider binary representation of xi: if the j-th bit of number xi equal to one, then the army of the i-th player has soldiers of the j-th type. Fedor is the (m xe2 x80 x89+ xe2 x80 x891)-th player of the game. He assume that two players can become friends if their armies differ in at most k types of soldiers (in other words, binary representations of the corresponding numbers differ in at most k bits). Help Fedor and count how many players can become his friends. The first line contains three integers n, m, k (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89k xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x8920; 1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89m xe2 x80 x89 xe2 x89 xa4 xe2 x80 x891000). The i-th of the next (m xe2 x80 x89+ xe2 x80 x891) lines contains a single integer xi (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89xi xe2 x80 x89 xe2 x89 xa4 xe2 x80 x892n xe2 x80 x89- xe2 x80 x891), that describes the i-th player's army. We remind you that Fedor is the (m xe2 x80 x89+ xe2 x80 x891)-th player. Print a single integer -- the number of Fedor's potential friends."...