#include <bits/stdc++.h>

using namespace std;

using ll = long long;

#define MOD (ll(1000000009))
#define MODb (ll(998244353))

// Binpow and stuff
ll BOW(ll a, ll x, ll p) {
  if (!x) return 1;
  ll res = BOW(a, x / 2, p);
  res *= res;
  res %= p;
  if (x % 2) res *= a;
  return res % p;
}
ll INV(ll a, ll p) {
  return BOW(a, p - 2, p);
}

vector < int > vec;
int n, m, i, j, k, t, t1, u, v, a, b;
string s[501];
int hsh[501];
int hsh1, hsh2, hsh3;
int hshb[501];
int hsh1b, hsh2b, hsh3b;

string reduc(string s, int k) {
  int a = 0, i, j;
  string res;
  for (i = 0; i < k; i++) {
    for (j = i; j < s.length(); j += k) {
      a += s[j];
    }
    res.push_back(a % 10);
    a /= 10;
  }
  while (a) {
    res.push_back(a % 10);
    a /= 10;
  }
  return res;
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> k;
  for (i = 0; i < n; i++) {
    cin >> s[i];
    reverse(s[i].begin(), s[i].end());
    for (char &c : s[i]) c -= '0';
    while (s[i].size() > k) {
      s[i] = reduc(s[i], k);
    }
  }
  for (i = 0; i < n; i++) {
    hsh[i] = 0;
    for (j = s[i].length() - 1; j >= 0; j--) {
      hsh[i] = ll(hsh[i]) * 10 + s[i][j] % MOD;
    }
  }
  hsh1 = 1;
  for (i = 0; i < k; i++) {
    hsh1 = ll(hsh1) * 10 % MOD;
  }
  hsh1 += MOD - 1;
  hsh1 %= MOD;
  hsh2 = hsh1 * 2 % MOD;
  hsh3 = (hsh1 + hsh2) % MOD;

  for (i = 0; i < n; i++) {
    hshb[i] = 0;
    for (j = s[i].length() - 1; j >= 0; j--) {
      hshb[i] = ll(hshb[i]) * 10 + s[i][j] % MODb;
    }
  }
  hsh1b = 1;
  for (i = 0; i < k; i++) {
    hsh1b = ll(hsh1b) * 10 % MODb;
  }
  hsh1b += MODb - 1;
  hsh1b %= MODb;
  hsh2b = hsh1b * 2 % MODb;
  hsh3b = (hsh1b + hsh2b) % MODb;

  int res = 0;
  for (i = 0; i < n; i++)
    for (j = i; j < n; j++)
      for (k = j; k < n; k++) {
        u = ((hsh[i] + hsh[j]) % MOD + hsh[k]) % MOD;
        v = ((hshb[i] + hshb[j]) % MODb + hshb[k]) % MODb;
        bool fu = (u == 0 || u == hsh1 || u == hsh2 || u == hsh3);
        bool fv = (v == 0 || v == hsh1b || v == hsh2b || v == hsh3b);
        res += fu && fv;
      }
  cout << res;
}