如果一个数字包含不超过 k （0,...,k） 的所有数字，则我们称它为 k-good。你有一个数字 k 和一个包含 n 个数字的数组 a。找出 a 中有多少个 k-good 数字（每次数组 a 中出现每个数字时都计算）。
Let's call a number k-good if it contains all digits not exceeding k (0,...,k). You've got a number k and an array a containing n numbers. Find out how many k-good numbers are in a (count each number every time it occurs in array a).
Input
The first line contains integers n and k (1≤n≤100, 0≤k≤9). The i-th of the following n lines contains integer ai without leading zeroes (1≤ai≤109).
Output
Print a single integer − the number of k-good numbers in a.