#include<bits/stdc++.h>
using namespace std;

const long long MOD[5] = {998244353, 1000000000 + 7, 1000000000 + 9, 19260817, 1000000000 + 3};
const int MAXN = 1e6 + 10;
int N,M,K,Q;
int a[MAXN];
struct Num{
    int val[20010];
    int top = 0;
    vector<long long> hash;

    void read(string &str){
        top = str.size() - 1;
        for(int i = 0; i <= top; i++){
            val[i] = str[str.size() - 1 - i] - '0';
        }
    }

    void ModK(){
        for(int base = top / K * K; base; base -= K){
            while(1){
                int flag = 0;
                for(int k = 0; k < K; k++){
                    if(base + k > 20005) break;
                    val[base - K + k] += val[base + k];
                    if(val[base + k]) flag = 1;
                    val[base + k] = 0;
                }
                if(flag == 0) break;
                for(int k = 0; k < K; k++){
                    if(val[base - K + k] >= 10){
                        val[base - K + k] -= 10;
                        val[base - K + k + 1]++;
                    }
                }
            }
        }
        int not9 = 0;
        for(int k = 0; k < K; k++){
            if(val[k] != 9) not9 = 1;
        }
        if(!not9){
            for(int k = 0; k < K; k++){
                val[k] = 0;
            }
        }
        top = 0;
        for(int k = 0; k < K; k++){
            if(val[k]) top = k;
        }
    }

    void print(){
        for(int i = top; i >= 0; i--){
            cout << val[i];
        }
        cout << endl;
    }

    void getHash(){
        hash.clear();
        hash.resize(5, 0);
        for(int i = top; i >= 0; i--){
            for(int k = 0; k < 5; k++){
                hash[k] = (hash[k] * 10 + val[i]) % MOD[k];
            }
        }
    }
}nums[210];

string str[210];

vector<long long> add(vector<long long> &a, vector<long long> &b){
    vector<long long> ret(5,0);
    for(int k = 0; k < 5; k++){
        ret[k] = (a[k] + b[k]) % MOD[k];
    }
    return ret;
}

vector<long long> del(vector<long long> &a, vector<long long> &b){
    vector<long long> ret(5,0);
    for(int k = 0; k < 5; k++){
        ret[k] = (a[k] - b[k]);
        if(ret[k] < 0) ret[k] += MOD[k];
    }
    return ret;
}

map<vector<long long>, int> mp;

void prepare(){
	cin >> N >> K;
    for(int i = 1; i <= N; i++){
        cin >> str[i];
        nums[i].read(str[i]);
        nums[i].ModK();
        nums[i].getHash();
        //cout << nums[i].hash[0] << "?" << endl;
    }
    nums[201].top = K - 1;
    for(int i = 0; i <= K - 1; i++){
        nums[201].val[i] = 9;
    }
    nums[201].getHash();

    nums[202].top = K;
    for(int i = 1; i <= K - 1; i++){
        nums[202].val[i] = 9;
    }
    nums[202].val[K] = 1;
    nums[202].val[0] = 8;
    nums[202].getHash();

    nums[203].top = 0;
    nums[203].getHash();
    for(int i = 1; i <= N; i++){
        mp[nums[i].hash]++;
        //for(int k = 0; k < 5; k++) cout << nums[i].hash[k] << " ";
        //cout << endl;
    }
    // for(int t = 1; t <= 3; t++){
    //     for(int k = 0; k < 5; k++) cout << nums[200 + t].hash[k] << " ";
    //     cout << endl;
    // }
    int ans = 0;
    for(int i = 1; i <= N; i++){
        //mp[nums[i].hash]--;
        for(int j = i; j <= N; j++){
            //mp[nums[j].hash]--;
            for(int k = 1; k <= 3; k++){
                vector<long long> tar = nums[200 + k].hash;
                tar = del(tar, nums[i].hash);
                tar = del(tar, nums[j].hash);
                //for(int t = 0; t < 1; t++) cout << tar[t] << " ";
                //cout << endl;
                //cout << i << " " << j << " " << mp[tar] << endl;
                ans += mp[tar];
            }
            mp[nums[j].hash]--;
        }
        for(int j = i; j <= N; j++){
            mp[nums[j].hash]++;
        }
        mp[nums[i].hash]--;
    }
    cout << ans << '\n';
}

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T = 1;
	//cin >> T;
	while(T--){
		prepare();
	}
}