#include <bits/stdc++.h>
using namespace std;
const int nmax = 1e5 + 1;
unordered_map<int, int> mp[1 << 6][1 << 6];
int p27[6];
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
p27[0] = 1;
for (int i = 1; i < 6; i++) {
p27[i] = p27[i - 1] * 27;
}
int n, m;
long long ans = 0;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
string s;
cin >> s;
int msk_cur = 0;
int val = 0;
vector<int> bz;
for (int j = 0; j < m; j++) {
if (s[j] == '?') {
continue;
} else {
msk_cur += (1 << j);
val += p27[j] * (s[j] - 'a');
}
}
for (int msk = 0; msk < (1 << 6); msk++) {
if ((msk & msk_cur) == msk) {
int x = 0;
int si = 0;
for (int j = 0; j < 6; j++) {
if (msk & (1 << j)) {
x += p27[j] * (s[j] - 'a');
} else if (msk_cur & (1 << j)) {
si += (1 << j);
}
}
if (mp[msk_cur][si].find(x) != mp[msk_cur][si].end()) {
ans += mp[msk_cur][si][x];
}
}
}
for (int msk = 0; msk < (1 << 6); msk++) {
int si = 0;
int val = 0;
for (int j = 0; j < 6; j++) {
if (msk & (1 << j)) {
if (s[j] == '?') {
si += (1 << j);
} else {
val += p27[j] * (s[j] - 'a');
}
}
}
mp[msk][si][val]++;
}
}
cout << ans;
return 0;
}
