#include<bits/stdc++.h>
using namespace std;
#define int long long
#define lowbit(x) (x & (-x))
typedef long long ll;
typedef pair<int,int> pii;
mt19937 rnd(time(0));
const int N = 2e4 + 7;
const int mod1 = 1145141819;
const int mod2 = 1e9 + 7;
// const int P = rnd() % mod;
string a[505];
pii h[505];
int ck[N];
int n , k;
string cal(string x) {
    string s;
    int n = x.length();
    for(int i = n - 1;i >= 0;i--) s += x[i];
    for(int i = 0;i < k;i++) ck[i] = 0;
    for(int i = 0;i < n;i++)  ck[i % k] += (s[i] - '0');
    int t = k,now = 0;
    while(t--) {
        if(ck[now] > 9) t = k;
        int res = ck[now] / 10;
        ck[now] %= 10;
        now = (now + 1) % k;
        ck[now] += res;
    }
    string ans = " ";
    for(int i = k - 1;i >= 0;i--) 
        ans += (char)(ck[i] + '0');
    return ans;
}
pii ha(string s) {
    int n = s.length() - 1;
    int res1 = 0,res2 = 0;
    for(int i = 1;i <= n;i++) {
        res1 = (res1 * 10 + s[i] - '0') % mod1;
        res2 = (res2 * 10 + s[i] - '0') % mod2;
    }
    return {res1,res2};
}
void solve() {
    cin >> n >> k;
    for(int i = 1;i <= n;i++) cin >> a[i];
    for(int i = 1;i <= n;i++) a[i] = cal(a[i]);
    string k1 = " ", k2 = " ";
    for(int i = 1;i <= k;i++) k1 += '9';
    k2 += '1';
    for(int i = 2;i < k;i++) k2 += '9';
    k2 += '8';
    pii h1 = ha(k1),h2 = ha(k2),h0 = {0,0};
    for(int i = 1;i <= n;i++) h[i] = ha(a[i]);
    int ans = 0;
    for(int i = 1;i <= n;i++) {
        for(int j = i;j <= n;j++) {
            for(int k = j;k <= n;k++) {
                pii res = {(h[i].first + h[j].first + h[k].first) % mod1,(h[i].second + h[j].second + h[k].second) % mod2};
                if(res == h1 || res == h2 || res == h0) ans++;
            }
        }
    }
    cout << ans << "\n";
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    // cin >> t;
    while(t--) solve();
    return 0;
}