cf 365A

#include <bits\stdc++.h>

using namespace std;

int main()
{
    int t, k, cnt = 0;
    cin >> t >> k;

    while(t--)
    {
        int n;
        cin >> n;
        set<int>ss;
        while(n > 0)
        {
            if(n % 10 <= k) ss.insert(n % 10);
            n /= 10;
        }

        //printf("size %d first %d last %d\n", ss.size(), first, last);
        if(ss.size() == k + 1) cnt++;
    }
    cout << cnt << endl;

}