#include<bits/stdc++.h>
using namespace std;
using ll = long long int;

const ll M1 = 1e9 + 9, M2 = 1e9 + 21;

vector<int> input[505];

void print(vector<int>& v){
    cout<<"> ";
    for(int i = (int) v.size() - 1; i>=0; i--){
        cout<<v[i];
    }
    cout<<endl;
}

void reduce(vector<int>& v, int k){
    if(v.size() > k){
        vector<int> w(v.begin(), v.begin()+k);

        int shift = k;
        auto getDigit = [&](int i) {
            int ii = shift + i;
            if(ii >= shift+k || ii >= v.size()) return 0;
            return v[ii];
        };

        while(shift < v.size()){
            int carry = 0;
            for(int i = 0; i < k; i++){
                int sum = w[i] + getDigit(i) + carry;
                if(sum > 9){
                    sum -= 10;
                    carry = 1;
                }
                else{
                    carry = 0;
                }
                w[i] = sum;
            }

            if(carry == 1){
                for(int i = 0; i<k; i++){
                    if(w[i] == 9){
                        w[i] = 0;
                    }
                    else{
                        w[i]++;
                        break;
                    }
                }
            }

            shift += k;
        }

        v = w;
    }

    if(count(v.begin(), v.end(), 9) == k)
        v = vector<int>{0};
    return;
}

pair<ll,ll> getHash(vector<int>& v){
    ll res1 = 0, res2 = 0;

    for(int x : v){
        res1 = (res1 * 10 + x) % M1;
        res2 = (res2 * 10 + x) % M2;
    }

    return make_pair(res1, res2);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int n, k;
    cin>>n>>k;

    for(int i = 0; i<n; i++){
        string s;
        cin>>s;
        for(int j = (int)s.size() - 1; j>=0; j--){
            input[i].push_back(s[j] - '0');
        }
    }

    for(int i = 0; i<n; i++){
        reduce(input[i], k);
    }

    vector<int> m(k, 9);

    vector<pair<ll, ll>> v;
    for(int i = 0; i<n; i++){
        v.emplace_back(getHash(input[i]));
//        cout<<v[i].first<<" - "<<v[i].second<<endl;
    }

    pair<ll, ll> target0 = make_pair(0LL, 0LL);
    pair<ll, ll> target = getHash(m);
    pair<ll, ll> target2 = make_pair(target.first * 2 % M1, target.second * 2 % M2);

//    cout<<target.first<<" - "<<target.second<<endl;
//    cout<<target2.first<<" - "<<target2.second<<endl;


    map<pair<ll, ll>, int> mp;
    int ans = 0;

    for(int i = 0; i<n; i++){
        mp[v[i]]++;

        for(int j = i; j<n; j++){
            auto x = make_pair((v[i].first + v[j].first) % M1, (v[i].second + v[j].second) % M2);

            auto cand0 = make_pair((M1 + target0.first - x.first) % M1, (M2 + target0.second - x.second) % M2);
            auto cand1 = make_pair((M1 + target.first - x.first) % M1, (M2 + target.second - x.second) % M2);
            auto cand2 = make_pair((M1 + target2.first - x.first) % M1, (M2 + target2.second - x.second) % M2);

            auto it = mp.find(cand0);
            if(it != mp.end()) ans += it->second;

            it = mp.find(cand1);
            if(it != mp.end()) ans += it->second;

            it = mp.find(cand2);
            if(it != mp.end()) ans += it->second;

//            cout<<ans<<" - "<<i<<" "<<j<<endl;
        }
    }

    cout<<ans<<endl;

}
/*
4 1
0
1
10
17
*/