#include <string.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;

constexpr int mod = 998244853;

void mpl(int &x,int y) {
    x += y;
    if(x >= mod) x -= mod;
}

int calc(string s) {
    int ans = 0;
    for(int i = 0; i < s.size(); i++) {
        ans = (10ll*ans+s[i]-'0')%mod;
    }
    return ans;
}

string plu(string s,string t) {
    string ans = "";
    reverse(s.begin(),s.end());
    reverse(t.begin(),t.end());
    int now = 0;
    for(int i = 0; i < max(s.size(),t.size()); i++) {
        int a = 0;
        if(i < s.size()) a += s[i]-'0';
        if(i < t.size()) a += t[i]-'0';
        a += now;
        ans += (char)('0'+a%10);
        a /= 10;
        now = a;
    }
    while(now) {
        ans += (char)('0'+now%10);
        now /= 10;
    }
    reverse(ans.begin(),ans.end());
    return ans;
}

int calc2(string s,int K) {
    vector<int>sum(s.size()+1);
    for(int i = 0; i < s.size(); i++) {
        sum[i+1] = (10ll*sum[i]+s[i]-'0')%mod;
    }
    int ans = 0;
    for(int i = K; i < s.size(); i += K) {
        mpl(ans,sum[s.size()-i]);
    }
    reverse(s.begin(),s.end());
    string res = "0";
    for(int i = 0; i < s.size(); i += K) {
        string t = s.substr(i,min((int)(s.size()-i),K)); 
        reverse(t.begin(),t.end());
        res = plu(res,t);
    }
    if(res.size() > K) {
        mpl(ans,calc2(res,K));
    }
    else if(res.size() == K && res == string(K,'9')) {
        ans++;
    }
    return ans;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,K;
    cin >> n >> K;
    vector<string>s(n);
    for(int i = 0; i < n; i++) {
        cin >> s[i];
    }
    int M = calc(string(K,'9'));
    vector<int>a(n);
    for(int i = 0; i < n; i++) {
        a[i] = calc(s[i]);
    }
    vector<int>b(n);
    for(int i = 0; i < n; i++) {
        b[i] = calc2(s[i],K);
    }
    int ans = 0;
    for(int i = 0; i < n; i++) {
        for(int j = i; j < n; j++) {
            for(int k = j; k < n; k++) {
                int now = ((long long)(a[i])+a[j]+a[k])%mod;
                int now2 = 0;
                mpl(now2,b[i]);
                mpl(now2,b[j]);
                mpl(now2,b[k]);
                for(int l = 0; l <= 3; l++) {
                    if(1ll*now2*M%mod == now) {
                        ans++;
                        break;
                    }
                    mpl(now2,1);
                }
            }
        }
    }
    cout << ans << "\n";
}