#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,K;
string S[202020];
int id[202020];
int D[5*5*5*5*5*5*5*5];
int p5[10];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	p5[0]=1;
	FOR(i,9) p5[i+1]=p5[i]*5;
	
	cin>>N>>K;
	FOR(i,N) {
		cin>>S[i];
		FORR(c,S[i]) {
			c-='0';
			id[i]=id[i]*5+c;
		}
		D[id[i]]++;
	}
	FOR(i,K) {
		for(j=p5[K]-1;j>=0;j--) {
			if(j/p5[i]%5) {
				D[j-p5[i]]+=D[j];
			}
		}
	}
	int ret=0;
	FOR(i,N) if(D[id[i]]>1) ret++;
	cout<<ret<<endl;
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}