//#pragma GCC optimize("Ofast", "unroll-loops")
//#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4")

#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <cmath>
#include <queue>
#include <bitset>
#include <numeric>
#include <array>
#include <cstring>
#include <random>
#include <chrono>
#include <cassert>

#define all(a) a.begin(),a.end()
#define len(a) (int)(a.size())
#define mp make_pair
#define pb push_back
#define fir first
#define sec second
#define fi first
#define se second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;

template<typename T>
bool umin(T &a, T b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
bool umax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

#ifdef KIVI
#define DEBUG for (bool _FLAG = true; _FLAG; _FLAG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl

template<class ...Ts>
auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }

#else
#define DEBUG while (false)
#define LOG(...)
#endif

mt19937 rng(4242);

const int max_n = 1e5 + 11, inf = 1000111222;

const bool DBG = false;

const int mod1 = 1e9 + 7, mod2 = 1e9 + 9;

int now[max_n];

void solve() {
    int n, k;
    cin >> n >> k;
    vector<string> a(n);
    for(auto& x : a) {
        if(DBG) {
            for (int i = 0; i < 100000; i++) x += (char) (rng() % 10 + '0');
//            x = to_string(rng() % 1000000000);
        } else {
            cin >> x;
        }
    }
    //take a mod 10^k - 1 = 9...9 (k times)
    string MODS = string(k, '9');
    int am_zeroes = 0;
    for (auto &i : a) {
        string was = i;
        int cc = 0;
        int l = 0, r = len(i) - 1;
        for (int j = 0; j < len(i); j++) {
            now[j] = i[j] - '0';
        }
        while (true) {
            for (int j = l; j + k <= r; j++) {
                now[j + k] += now[j];
                now[j] = 0;
            }
            int carry = 0;
            for (int j = r; j >= l; j--) {
                int val = now[j] + carry;
                carry = val / 10;
                now[j] = val % 10;
            }
            while (l <= r && now[l] == 0) {
                ++l;
            }
            if (r - l + 1 <= k) {
                break;
            }
        }
        if (r - l + 1 == 0) {
            i = "0";
        }
        else {
            i = string(r - l + 1, '0');
            for (int j = l; j <= r; j++) {
                i[j - l] = char('0' + now[j]);
            }
        }
        if(i.empty()) i = "0";
        if(i == MODS) i = "0";
        if(count(all(i), '0') == len(i)) am_zeroes++;
//        cout << stoi(i) << ' ' << stoi(was) << ' ' << stoi(was) % 99 << endl;
//        if(stoi(i) != stoi(was) % 999) exit(-1);
//        assert(stoi(i) == stoi(was) % 99);
    }
    ll ans = (am_zeroes + am_zeroes * 1ll * (am_zeroes - 1) * (am_zeroes - 2) / 6 + am_zeroes * (am_zeroes - 1) / 2 * 2);
    string need1S = string(k, '9');
    string need2S = string(1, '1') + string(k - 1, '9') + string(1, '8');
    pair<int, int> need1 = {0, 0}, need2 = {0, 0};
    {
        for (int j = 0; j < len(need1S); j++) {
            need1.fi = (need1.fi * 1ll * 10 + need1S[j] - '0') % mod1;
            need1.se = (need1.se * 1ll * 10 + need1S[j] - '0') % mod2;
        }
        for (int j = 0; j < len(need2S); j++) {
            need2.fi = (need2.fi * 1ll * 10 + need2S[j] - '0') % mod1;
            need2.se = (need2.se * 1ll * 10 + need2S[j] - '0') % mod2;
        }
    }
    vector<pair<int, int> > rem(n, {0, 0});
    for(int guy = 0; guy < n; guy++) {
        for(int i = 0; i < len(a[guy]); i++) {
            rem[guy].fi = (rem[guy].fi * 1ll * 10 + (a[guy][i] - '0')) % mod1;
            rem[guy].se = (rem[guy].se * 1ll * 10 + (a[guy][i] - '0')) % mod2;
        }
    }
    map<pair<int, int>, int> am;
    for(int i = 0; i < n; i++) {
//        for(int j = i; j < n; j++)
//            for(int K = j; K < n; K++) {
//                ans += (rem[i].fi + rem[j].fi + rem[K].fi) % mod1 == need1.fi && (rem[i].se + rem[j].se + rem[K].se) % mod2 == need1.se;
//                ans += (rem[i].fi + rem[j].fi + rem[K].fi) % mod1 == need2.fi && (rem[i].se + rem[j].se + rem[K].se) % mod2 == need2.se;
//            }
        for(int j = i; j < n; j++) am[rem[j]]++;
        auto cneed1 = pii{need1.fi - rem[i].fi, need1.se - rem[i].se};
        if(cneed1.fi < 0) cneed1.fi += mod1;
        if(cneed1.se < 0) cneed1.se += mod2;
        auto cneed2 = pii{need2.fi - rem[i].fi, need2.se - rem[i].se};
        if(cneed2.fi < 0) cneed2.fi += mod1;
        if(cneed2.se < 0) cneed2.se += mod2;
        for(int j = i; j < n; j++) {
            auto ccneed1 = pii{cneed1.fi - rem[j].fi, cneed1.se - rem[j].se};
            if(ccneed1.fi < 0) ccneed1.fi += mod1;
            if(ccneed1.se < 0) ccneed1.se += mod2;
            auto ccneed2 = pii{cneed2.fi - rem[j].fi, cneed2.se - rem[j].se};
            if(ccneed2.fi < 0) ccneed2.fi += mod1;
            if(ccneed2.se < 0) ccneed2.se += mod2;
            ans += am[ccneed1];
            ans += am[ccneed2];
            am[rem[j]]--;
        }
    }
    cout << ans << '\n';
//    ll ans2 = 0;
//    for(int i = 0; i < n; i++)
//        for(int j = i; j < n; j++)
//            for(int K = j; K < n; K++)
//                if((stoi(a[i]) + stoi(a[j]) + stoi(a[K])) % 999 == 0) {
//                    ans2++;
//                }
//    cout << ans2 << '\n';
}

int main() {
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t = 1;

//    cin >> t;

    while (t--) solve();

}

/*
 *
 */