// #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=2e6+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;


ll a[N][2];

constexpr int mod = 936500749, mod2 = 889171919;
void solve(){
    cin >> n >> m;
    ll ans = 0, ans2 = 0;
    for(int i=1; i<=m; ++i){
        ans = (ans * 10 % mod + 9) % mod;
        ans2 = (ans2 * 10 % mod2 + 9) % mod2;
    }
    ll ans3 = (ans + ans) % mod, ans4 = (ans2 + ans2) % mod2;
    string s;
    for(int i=1; i<=n; ++i){
        cin >> s;
        reverse(s.begin(), s.end());
        for(int j=0; j<s.size(); ++j){
            int k = min(j + m - 1, (int)s.size()-1);
            int kk = k;
            ll temp = 0, temp2 = 0;
            for(; k>=j; --k){
                temp = (temp * 10 % mod + s[k] - '0') % mod;
                temp2 = (temp2 * 10 % mod2 + s[k] - '0') % mod2;
            }
            a[i][0] = (a[i][0] + temp) % mod;
            a[i][1] = (a[i][1] + temp2) % mod2;
            j = kk;
        } 
        if(a[i][0] == ans)a[i][0] = 0;
        if(a[i][1] == ans2)a[i][1] = 0;
        // if(a[i][0] == ans && a[i][1] == ans2)a[i][0] = a[i][1] = 0;
        // cout << a[i][0] << ' ' << a[i][1] << endl;
    }
    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;

}