#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define codefor int test;cin>>test;while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
using namespace std;
using ll = long long;
template<class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
template<class T> istream& operator>>(istream& is, vector<T>& vec) {for(T& x : vec)is >> x;return is;}
template<class T> ostream& operator<<(ostream& os, const vector<T>& vec) {if(vec.empty())return os;os << vec[0];for(auto it = vec.begin(); ++it!= vec.end();)os << ' ' << *it;return os;}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){cin >> head;in(tail...);}
void out(){cout << '\n';}
template<class T>void out(const T& a){cout << a << '\n';}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){cout << head << ' ';out(tail...);}
const int INF = 1 << 30;
const long long INF2 = 1ll << 60;
template<class T> void chmax(T &a,const T b){if(b>a)a=b;}
template<class T> void chmin(T &a,const T b){if(b<a)a=b;}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    INT(n, k);
    vector<string> a(n);
    vector<bool> dp2(25 * 25 * 25 * 25);
    vector<int> dp(25 * 25 * 25 * 25);
    int ans = 0;
    for(int i = 0; i < n; i++){
        cin >> a[i];
        int v = 0, d = 1;
        for(int j = 0; j < k; j++){
            v += d * (a[i][j] - '0');
            d *= 5;
        }
        dp2[v] = true;
        dp[v] = 1;
    }
    for(int i = 0, d = 1; i < 8; i++){
        for(int j = 0; j < dp.size(); j++){
            int rem = (j / d) % 5;
            int to = j + d;
            if(rem < 4){
                if(dp2[to]){
                    ans += dp[j];
                }else{
                    dp[to] += dp[j];
                }
            }
        }
        d *= 5;
    }
    cout << ans << endl;
}