#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, k; cin >> n >> k;
	vector<string> s(n);
	rep(i, n)cin >> s[i];
	int sz = 1;
	rep(i, k)sz *= 5;
	vector<int>dp(sz, 0);
	vector<int>ts(n);
	rep(i, n) {
		int f = 1;
		int x = 0;
		rep(j, s[i].size()) {
			x += f * ('4' - s[i][j]);
			f *= 5;
		}
		ts[i] = x;
		dp[x]++;
	}

	// 遷移
	rep(j, k) {//桁数
		int five = 1;
		rep(i, j)five *= 5;
		rrep(i, sz) {
			// iの下からj桁目
			int num = (i / five) % 5;
			rep(k, num) {
				dp[i] += dp[i - five * (num - k)];
			}
		}
	}
	int ans = 0;
	rep(i, n)if (dp[ts[i]] > 1)ans++;
	cout << ans << endl;
	return 0;
}