// 想定解（エンコード、vector<int> で全てを管理）
#include <bits/stdc++.h>
using namespace std;
using Int = long long;
constexpr static int mod = 1e9 + 7;
constexpr static int inf = (1 << 30) - 1;
constexpr static Int infll = (1LL << 61) - 1;
int Competitive_Programming = (ios_base::sync_with_stdio(false), cin.tie(nullptr), cout << fixed << setprecision(15), 0);

int enc(string &s)
{
	int ret = 0;
	for (int i = 0; i < s.size(); i++)
		ret *= 8, ret += s[i] - '0';
	return ret;
}

int dfs(string &s, vector<int> &dp, vector<int> &mp, vector<int> &used)
{
	int e = enc(s), ret = 0;
	if (dp[e] != -1)
	{
		ret = (used[e] ? 0 : dp[e] + mp[e]), used[e] = 1;
		return ret;
	}

	for (int i = 0; i < s.size(); i++)
	{
		if (s[i] == '0')
			continue;
		s[i]--, ret += dfs(s, dp, mp, used);
		ret += (used[enc(s)] == 0 and mp[enc(s)] == 1);
		used[enc(s)] = 1, s[i]++;
	}

	return dp[e] = ret;
}

int main()
{
	int N, K;
	cin >> N >> K;
	vector<string> s(N);
	vector<int> mp(1 << (3 * K));
	vector<int> used(1 << (3 * K)), dp(1 << (3 * K), -1);
	int ans = 0;
	assert(1 <= K and K <= 8);
    assert(1 <= N and N <= min(2e5, pow(5, K)));
	for (int i = 0; i < N; i++)
	{
		cin >> s[i];
		mp[enc(s[i])]++;
		assert(s[i].size() == K);
		for(int j = 0; j < K; j++) assert('0' <= s[i][j] and s[i][j] <= '4');
	}

	for (int i = 0; i < N; i++)
		ans += dfs(s[i], dp, mp, used), dp[enc(s[i])] = 0;

	cout << ans << '\n';
}