#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace __gnu_pbds;
using namespace std;
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ff first
#define sc second
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ull unsigned long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rngl(chrono::steady_clock::now().time_since_epoch().count());
// #define int long long
// #define int unsigned long long
// #define ordered_set(T) tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>
// #define ordered_multiset(T) tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>
const ll mod = 1e9 + 7;
// const ll mod = 998244353;
const ll inf = 1e9;
const ll biginf = 1e18;
const int maxN = 5 * 1e4 + 15;
map<string, int> cnt;
int n, d; string s[maxN];
void solve() {
cin >> n >> d;
for (int i = 1; i <= n; i++) cin >> s[i];
int ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 0; j < 16; j++) {
string cur; int popc = __builtin_popcount(j);
for (int k = 0; k < 4; k++) {
if ((j >> k) % 2 == 1) cur.pb(s[i][k]);
else cur.pb('&');
}
if (d == 1) {
if (popc == 3) ans += cnt[cur];
else if (popc == 4) ans -= 3 * cnt[cur];
}
if (d == 2) {
if (popc == 2) ans += cnt[cur];
else if (popc == 3) ans -= 3 * cnt[cur];
else if (popc == 4) ans += 3 * cnt[cur];
}
if (d == 3) {
if (popc == 1) ans += cnt[cur];
else if (popc == 2) ans -= 2 * cnt[cur];
else if (popc == 3) ans += 3 * cnt[cur];
else if (popc == 4) ans -= cnt[cur];
}
if (d == 4) {
if (popc & 1) ans -= cnt[cur];
else ans += cnt[cur];
}
}
for (int j = 0; j < 16; j++) {
string cur;
for (int k = 0; k < 4; k++) {
if ((j >> k) % 2 == 1) cur.pb(s[i][k]);
else cur.pb('&');
}
cnt[cur]++;
}
}
cout << ans;
}
int32_t main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
int t = 1;
// cin >> t;
while (t--) {
solve();
cout << '\n';
}
return 0;
}
