/*
In the name of Allah
made by: Ahmed_Solyman
*/
#include <bits/stdc++.h>
#include <ext/rope>
using namespace std;
using namespace __gnu_cxx;
#pragma GCC optimize("-Ofast")
#pragma GCC optimize("-O1")
//-------------------------------------------------------------//
typedef long long ll;
typedef unsigned long long ull;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define PI acos(-1)
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define sum_to(n) (n*(n+1))/2
#define pb push_back
#define pf push_front
#define fil(arr,x) memset(arr,x,sizeof(arr))
const ll mod=1e9+7;
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
//-------------------------------------------------------------//
ll lcm(ll a,ll b)
{
return (max(a,b)/__gcd(a,b))*min(a,b);
}
void person_bool(bool x)
{
cout<<(x?"YES":"NO")<<endl;
}
void run(){
#ifndef ONLINE_JUDGE
freopen("input.in", "r", stdin);
freopen("output.out", "w", stdout);
#endif
}
int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
fast
//run();
int n,m;cin>>n>>m;
vector<string>v(n);
for(auto &i:v)cin>>i;
ll ans=0;
for(int i=0;i<n;i++){
unordered_map<string,int>fr;
for(int j=i+1;j<n;j++)fr[v[j]]++;
for(int j=i+1;j<n;j++){
fr[v[j]]--;
string s="";
for(int k=0;k<m;k++){
if(v[i][k]==v[j][k]){
s+=v[i][k];
}
else{
s+=('1'+'2'+'3')-(v[i][k]+v[j][k]);
}
}
ans+=fr[s];
}
}
cout<<ans<<endl;
return 0;
}
