// #pragma GCC optimize(2)
#include<bits/stdc++.h>
#define endl '\n'
#define lowbits(x) ((x)&((-x)))
#define INF 0x3f3f3f3f
#define uu __int128
#define PI acos(-1)
#define ls k<<1
#define rs k<<1|1
using namespace std;
typedef  long long ll;
typedef  unsigned long long ull;
typedef pair<int, int> P;
typedef pair<int, pair<int, int> > PII;
constexpr int N=500+10, M=2*N;
// constexpr int mod=998244353;
constexpr double eps=1e-9;
int nx[] = {0, 0, 1, -1}, ny[] = {1, -1, 0, 0};


int n,m;


int a[N][2];

constexpr int mod = 936500749, mod2 = 889171919;

vector<int> operator + (const vector<int> &a, const vector<int> &b){
    vector<int> temp(max(a.size(), b.size()) + 5);
    for(int i=0; i<a.size() || i<b.size(); ++i){
        if(i < a.size())temp[i] += a[i];
        if(i < b.size())temp[i] += b[i];
        temp[i+1] += temp[i] / 10;
        temp[i] %= 10;
    }
    while(temp.size() > 1 && temp.back() == 0)temp.pop_back();
    return temp;
}
int b[N], idx;
void solve(){
    cin >> n >> m;
    int ans = 0, ans2 = 0;
    for(int i=1; i<=m; ++i){
        ans = ((ll)ans * 10 % mod + 9) % mod;
        ans2 = ((ll)ans2 * 10 % mod2 + 9) % mod2;
    }
    int ans3 = (ans + ans) % mod, ans4 = (ans2 + ans2) % mod2;
    string s;
    for(int i=1; i<=n; ++i){
        cin >> s;
        reverse(s.begin(), s.end());
        vector<int> cur(1, 0);
        for(int j=0; j<s.size();){
            for(int k=0; k<m; ++k){
                if(j+k < s.size()){
                    if(cur.size() < k+1)cur.push_back(0);
                    cur[k] += s[j+k] - '0';
                    if(cur.size() < k+2)cur.push_back(0);
                    if(cur[k] > 10)cur[k+1]++, cur[k] -= 10;
                }
            }
            while(cur.size() > 1 && cur.back() == 0)cur.pop_back();
            while(cur.size() > m){
                idx = 0;
                for(int k=m; k<cur.size(); ++k)b[idx++] = cur[k];
                while(cur.size() > m)cur.pop_back();
                for(int k=0; k<m; ++k){
                    if(k < idx)
                    cur[k] += b[k];
                    if(cur.size() < k+2)cur.push_back(0);
                    if(cur[k] > 10)cur[k+1]++, cur[k] -= 10;
                }
                while(cur.size() > 1 && cur.back() == 0)cur.pop_back();
            }
            j += m;
        } 
        if(cur.size() == m){
            bool f = true;
            for(auto &x : cur)if(x != 9)f = false;
            if(f){
                cur.clear();
                cur.push_back(0);
            }
        }
        reverse(cur.begin(), cur.end());
        // nums.push_back(cur);
        for(auto &x : cur){
            a[i][0] = (a[i][0] * 10 + x) % mod;
            a[i][1] = (a[i][1] * 10 + x) % mod;
        }
    }
    int res = 0;
    for(int i=1; i<=n; ++i)for(int j=i; j<=n; ++j)for(int k=j; k<=n; ++k){
        ll p1 = (a[i][0] + a[j][0] + a[k][0]) % mod;
        ll p2 = (a[i][1] + a[j][1] + a[k][1]) % mod2;
        // ll temp = res;
        if(p1 == 0 && p2 == 0)++res;
        else if(p1 == ans && p2 == ans2)++res;
        else if(p1 == ans3 && p2 == ans4)++res;
    }
    cout << res << endl;


}


signed main()
{   
    ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
    int t = 1;
    // cout << fixed << setprecision(9)
    // cin >> t;
    while(t--)solve();
    return 0;

}