#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector,Ofast")
using namespace std;
typedef int ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+9;
const ll MOD2=998244353;
const ll N=5e4+5;
const ld pi=acos(-1);
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()
#define count(_a) (ll)__builtin_popcount(_a)
ll n,d,ans=0,v[N][4];
string s;
ll id[N],cnt[N];
unordered_map<ll,ll> mm[N];
ll num(char c){
return ((c>='0'&&c<='9')?c-'0':10+c-'a');
}
ll vec(ll mask,ll id){
ll tmp=0;
REP(i,4)if((mask>>i)&1)tmp=tmp*37+v[id][i]+1;else tmp=tmp*37;
return tmp;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
cin>>n>>d;
REP(i,n){
cin>>s;
REP(j,4)v[i][j]=num(s[j]);
}
for(ll mask=0;mask<(1<<4);++mask){
if(count(mask)!=d)continue;
vector<ll> vid;
REP(i,n){
id[i]=0;
REP(j,4)if(!((mask>>j)&1)){
id[i]=id[i]*36+v[i][j];
}
vid.pb(id[i]);
}
sort(vid.begin(),vid.end());
vid.erase(unique(vid.begin(),vid.end()),vid.end());
REP(i,n){
id[i]=lwb(vid.begin(),vid.end(),id[i])-vid.begin();
for(ll bit=mask;;bit=(bit-1)&mask){
ll val=vec(bit,i);
if(count(bit)&1){
ans-=mm[id[i]][val];
++mm[id[i]][val];
}else{
ans+=mm[id[i]][val];
++mm[id[i]][val];
}
if(bit==0)break;
}
}
REP(i,n){
mm[id[i]].clear();
}
}
cout<<ans<<"\n";
return 0;
}
