Codeforces Round #213 (Div. 2) A. Good Number

#include <iostream>
#include <vector>

using namespace std;
int main(){
    int n,k,cnt = ;
    cin >> n >>k;
    for( int i =  ; i < n ;  ++ i ){
        int a;
        vector<int> goodNum(k+,);
        cin >> a;
        while(a){
            if(a%<=k) goodNum[a%]++;
            a/=;
        }
        int j  = ;
        for(j =  ; j < k+; ++ j)
            if(!goodNum[j]) break;
        if(j >= k +) cnt++;
    }
    cout<<cnt<<endl;
    return ;
}