#include <bits/stdc++.h>
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
/*
Three random primes between 10^8 and 10^9 are: 
815583701
564956243
521310523
Generated with randome_prime.cpp
*/

typedef long long LL;
int N, K;
vector<int> mod_M[505];
vector<LL> mod_P[505];
const int NUM_PRIMES = 3;
vector<LL> primes = {815583701, 564956243, 521310523};
set<LL> targets[NUM_PRIMES];


LL mod_prime(vector<int> n, LL p) {
    LL res = 0;
    for (int i = 0; i < K; i++) res = (res * 10 + n[i]) % p;
    return res;
}

vector<int> parse(string s) {
    vector<int> res(K, 0);
    int carry = 0;
    bool done_str = false;
    for (;;) {
        for (int i = 0; i< K; i++) {
            if (!done_str) {
                int pos = s.size() - 1 - i;
                while (pos >= 0) {
                    res[K-i-1] += s[pos] - '0';
                    pos -= K;
                }
            }
            res[K-i-1] += carry;
            carry = res[K-i-1] / 10;
            res[K-i-1] %= 10;
            if (done_str && !carry) break;
        }
        done_str = true;
        if (!carry) break;
    }
    if (all_of(res.begin(), res.end(), [](int i){ return i == 9; })) res = vector<int>(K, 0);
    return res;
}

int main() {
    cin >> N >> K;
    for (int i = 0; i < N; i++) {
        string s;
        cin >> s;
        mod_M[i] = parse(s);
        mod_P[i] = vector<LL>(NUM_PRIMES, 0);
        for (int j=0; j < NUM_PRIMES; j++) {
            mod_P[i][j]=mod_prime(mod_M[i], primes[j]);
        }
    }
    vector<int> M = vector<int>(K, 9);
    for (int i = 0; i < NUM_PRIMES; i++) {
        targets[i] = set<LL>();
        targets[i].insert(0);
        LL a = mod_prime(M, primes[i]);
        targets[i].insert(a);
        targets[i].insert(2*a % primes[i]);
    }

    int cnt = 0;
    for (int i = 0; i < N; i++) {
        for (int j = i; j < N; j++) {
            for (int k = j; k < N; k++) {
                bool ok = true;
                for (int l = 0; l < NUM_PRIMES; l++) {
                    if (targets[l].find((mod_P[i][l] + mod_P[j][l] + mod_P[k][l])%primes[l]) == targets[l].end()) {
                        ok = false;
                        break;
                    }
                }
                if (!ok) continue;
                // TODO: verify?
                if (ok) cnt++;
            }
        }
    }
    cout << cnt<< endl;
}