#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define Rep(i, a, b) for (int i = a; i >= (b); i--)
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
#define SZ(x) (int)(x.size())
#define lowbit(x) ((x) & -(x))
using db = double;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using i128 = __int128_t;
// Think twice, code once

const int N = 505;
const ull mod = 10000007998244353;
int n, k;
ull hs[N];
ull get_hash(vi a) {
    ull h = 0;
    reverse(all(a));
    for (auto x : a) {
        h = (h * 10 + x) % mod;
    }
    return h;
}
void get_mod(vi &a) {
    while (SZ(a) > k) {
        Rep(i, SZ(a) - 1, k) {
            int t = a[i];
            a[i - k] += t;
            a.pop_back();
        }
        assert(SZ(a) == k);
        int carry = 0;
        rep(i, 0, k) {
            int cur = a[i] + carry;
            a[i] = cur % 10;
            carry = cur / 10;
        }
        while (carry) {
            a.pb(carry % 10);
            carry /= 10;
        }
    }
    if (a == vi(k, 9)) a = {0};
}
void trans(string s, int i) {
    vi a;
    for (auto c : s) a.pb(c - '0');
    reverse(all(a));
    get_mod(a);
    hs[i] = get_hash(a);
}
void solve() {
    cin >> n >> k;
    ull M0 = 0, M1 = 0, M2 = 0;
    rep(i, 0, k) {
        M1 = (M1 * 10 + 9) % mod;
    }
    rep(i, 0, k + 1) {
        M2 = (M2 * 10 + (!i ? 1 : i == k ? 8 : 9)) % mod;
    }
    rep(i, 0, n) {
        string s; cin >> s;
        trans(s, i);
    }
    int ans = 0;
    rep(i, 0, n) rep(j, i, n) rep(k, j, n) {
        ull cur = ((hs[i] + hs[j]) % mod + hs[k]) % mod;
        if (cur == M0 || cur == M1 || cur == M2) ans++;
    }
    cout << ans << endl;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    int T = 1;
    // cin >> T;
    while (T--) solve();
    return 0;
}