#include <bits/stdc++.h>

using namespace std;

#define ar array
#define ll long long
typedef int uci;
#define int long long
#define F first
#define S second
typedef complex<double> cd;

seed_seq seq{
    (uint64_t) chrono::duration_cast<chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count(),
    (uint64_t) __builtin_ia32_rdtsc(),
    (uint64_t) (uintptr_t) make_unique<char>().get()
};
mt19937 rng(seq);
// mt19937_64 lrng(seq);

struct debugger{
    template <typename T>
    debugger& operator<<(T &a){
        #ifdef DEBUG
            cerr << a;
        #endif
        return *this;
    }
    template <typename T>
    debugger& operator<<(T &&a){
        #ifdef DEBUG
            cerr << a;
        #endif
        return *this;
    }
} deb;

const double PI = acos(-1.0);
const int MAX_N = 1e5 + 1;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;

//! function insert

//THINK FIRST, CODE SECOND
//DON'T GET STUCK ON ONE STRATEGY
//CALM DOWNNN FOR ONCE IN YOUR LIFE
//REDUCE
//COUGH E??!?!?!! O.O
//uwu i see you ryan

bool check(int val, int m){
    return val == 0 || val == m || val == m*2;
}

void solve() {
    int n, k;
    cin >> n >> k;

    const int num = 10;
    vector<int> vals{100000721,	100000793, 	100000799,	100000801,	100000837,	100000841,	100000853,	10000089, 100000921,100000937};
    vector<int> ms(num);
    for(int j{}; j < k; ++j){
        for(int i{}; i < num; ++i){
            ms[i] *= 10;
            ms[i] += 9;
            ms[i] %= vals[i];
        }
    }
    vector<vector<int>> a(n, vector<int>(k+1));
    for(int i{}; i < n; ++i){
        string s;
        cin >> s;

        for(int j{};j < s.size(); ++j){
            a[i][j%k] += s[j]-'0';
        }
        while(a[i][0]>9) {
            for(int j=0; j<k; ++j) a[i][j+1]+=a[i][j]/10,a[i][j]%=10;
            a[i][0]+=a[i][k]; a[i][k]=0;
        }
        /*
        for(int j{}; j < k-1; ++j){
            a[i][j+1] += a[i][j]/10;
            a[i][j] = a[i][j]%10;
        }

        while(a[i][k-1] >= 10){
            int carry = a[i][k-1]/10;
            a[i][k-1] %= 10;

            a[i][0] += carry;
            for(int j{}; j < k-1; ++j){
                if(a[i][j] < 10)
                    break;
                a[i][j+1] += a[i][j]/10;
                a[i][j] %= 10;
            }
        }
        */
        int cnt{};
        for(int j{}; j < k; ++j){
            if(a[i][j] == 9)
                cnt++;
        }
        if(cnt == k)
            for(int j{}; j < k; ++j)
                a[i][j] = 0;
    }
    vector<ar<int, num>> c(n);
    for(int i{}; i < n; ++i){
        for(int j{}; j < k; ++j){
            for(int o{}; o < num; ++o){
                c[i][o] *= 10;
                c[i][o] += a[i][j];
                c[i][o] %= vals[o];
            }
        }
    }

    int out{};
    for(int i{}; i < n; ++i){
        for(int j = i; j < n; ++j){
            for(int k = j; k < n; ++k){
                int tot{};
                for(int o{}; o < num; ++o){
                    int v = (c[i][o]+c[j][o]+c[k][o]);
                    if(check(v, vals[o]) || check(v-ms[o], vals[o]) || check(v-2*ms[o], vals[o]))
                        tot++;
                    else
                        break;
                }
                if(tot == num)
                    out++;
            }
        }
    }
    cout << out << '\n';
}

uci main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);

        // cout << "Case #" << t  << ": ";
        solve();
}

/*
    random number generator stuff
    num = rng(); gives integer number
    num = uniform_int_distribution<int>(a, b)(rng); -> bounds [a, b]
    num = uniform_real_distribution<double>(a, b)(rng); -> bounds [a, b)
    can also instantiate distributions and call on generator:
    uniform_int_distribution<int> thing(a, b);
    num = thing(rng);
*/
// struct custom_hash {
//     static uint64_t splitmix64(uint64_t x) {
//         // http://xorshift.di.unimi.it/splitmix64.c
//         x += 0x9e3779b97f4a7c15;
//         x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
//         x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
//         return x ^ (x >> 31);
//     }
//     size_t operator()(uint64_t x) const {
//         static const uint64_t FIXED_RANDOM = lrng();
//         return splitmix64(x + FIXED_RANDOM);
//     }
// };