#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

using BigInt = vector<ll>;
const int N = 505, base = 131, mod = 998244353;
int n, k, h1[N], h2[N];
BigInt nums[N];
map<int, int> mp;
int get_hash(BigInt a) {
    int h = 0;
    reverse(all(a));
    for (auto x : a) {
        h = (1ll * h * base % mod + x % mod) % 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();
        }
        int carry = 0;
        rep(i, 0, SZ(a)) {
            int cur = a[i] + carry;
            a[i] = cur % 10;
            carry = cur / 10;
        }
        while (carry) {
            a.pb(carry % 10);
            carry /= 10;
        }
    }
}
void print(BigInt a) {
    reverse(all(a));
    for (auto x : a) cout << x;
    cout << endl;
}
BigInt trans(vi a) {
    while (SZ(a) % 18) a.pb(0);
    BigInt ret;
    while (!a.empty()) {
        ll x = 0;
        rep(i, 0, 18) {
            x = x * 10 + a.back();
            a.pop_back();
        }
        ret.pb(x);
    }
    return ret;
}
void trans(string s, int i) {
    vi a;
    for (auto c : s) a.pb(c - '0');
    reverse(all(a));
    get_mod(a);
    nums[i] = trans(a);
    vi b = a;
    assert(SZ(a) <= k);
    b.resize(k);
    rep(i, 0, k) b[i] = 9 - b[i];
    h1[i] = get_hash(trans(b));
    int carry = 0;
    rep(i, 0, k) {
        int cur = b[i] + carry + 9;
        b[i] = cur % 10;
        carry = cur / 10;
    }
    while (carry) {
        b.pb(carry % 10);
        carry /= 10;
    }
    h2[i] = get_hash(trans(b));
}
const ll P = 1e18;
void solve() {
    cin >> n >> k;
    int len = 0;
    rep(i, 0, n) {
        string s; cin >> s;
        trans(s, i);
        mp[h1[i]]++;
        mp[h2[i]]++;
        len = max(len, SZ(nums[i]));
        if (s == "0") mp[0]++;
        // print(a[i]);
        // cout << h1[i] << ' ' << h2[i] << endl;
    }
    rep(i, 0, n) nums[i].resize(len);
    BigInt a(len);
    int ans = 0;
    rep(i, 0, n) {
        rep(j, 0, i + 1) {
            int carry = 0;
            a.resize(len);
            rep(k, 0, len) {
                ll cur = nums[i][k] + nums[j][k] + carry;
                a[k] = cur % P;
                carry = cur / P;
            }
            while (carry) {
                a.pb(carry % P);
                carry /= P;
            }
            int h = get_hash(a);
            // cout << i << ' ' << j << ' ' << h << endl;
            ans += mp[h];
        }
        mp[h1[i]]--;
        mp[h2[i]]--;
    }
    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;
}