#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IOS                           \
    std::ios::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL);
#define endl "\n"

const ll N = 510;
const ll mod1 = 1e9 + 7;
const ll mod2 = 1e9 + 9;
const ll mod3 = 998244353;

ll n, k;
ll a[N], b[N], c[N];

void solve()
{
    cin >> n >> k;
    for (int i = 1; i <= n; i++)
    {
        string s;
        cin >> s;reverse(s.begin(),s.end());
        vector<ll> t(k);
        for (int j = 0; j < s.size(); j++)
        {
            t[j % k] += s[j] - '0';
        }
        
        ll tmp=0;
        do
        {
            for (int i = 0; i < k; i++)
            {
                t[i] += tmp;
                tmp = t[i] / 10;
                t[i] %= 10;
            }
        } while (tmp);

        for (int j = k-1; j >=0; j--)
        {
            a[i] = (a[i] * 10 + t[j]) % mod1;
            b[i] = (b[i] * 10 + t[j]) % mod2;
            c[i] = (c[i] * 10 + t[j]) % mod3;
        }
    }

    ll m1, m2, m3;
    m1 = m2 = m3 = 0;
    for (int i = 0; i < k; i++)
    {
        m1 = (m1 * 10 + 9) % mod1;
        m2 = (m2 * 10 + 9) % mod2;
        m3 = (m3 * 10 + 9) % mod3;
    }

    // cout<<a[1]<<" "<<a[2]<<" "<<a[3]<<endl;
    // cout<<m1<<" "<<m2<<" "<<m3<<endl;

    ll ans = 0;
    for (int i = 1; i <= n; i++)
    {
        for (int j = i; j <= n; j++)
        {
            for (int k = j; k <= n; k++)
            {
                ll re = (a[i] + a[j] + a[k]) % mod1;
                bool ok1 = (re == 0) || (re == m1) || (re == m1 * 2 % mod1) || (re == m1 * 3 % mod1);
                re = (b[i] + b[j] + b[k]) % mod2;
                bool ok2 = (re == 0) || (re == m2) || (re == m2 * 2 % mod2) || (re == m2 * 3 % mod2);
                re = (c[i] + c[j] + c[k]) % mod3;
                bool ok3 = (re == 0) || (re == m3) || (re == m3 * 2 % mod3) || (re == m3 * 3 % mod3);
                if (ok1 && ok2 && ok3)
                    ans++;
            }
        }
    }

    cout << ans << endl;
}

int main()
{
    IOS;
    int T = 1; // cin>>T;
    while (T--)
    {
        solve();
    }

    return 0;
}