#include <bits/stdc++.h>
#define int long long 
#define rep(x, l, r) for(int x = l; x <= r; x++)
#define repd(x, r, l) for(int x = r; x >= l; x--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

const int mod2 = 1e18 + 9;
const int mod3 = 1e17 + 7;
const int MAXN = 505;
const int MAXM = 2e4 + 5;
int a[MAXN][MAXM];
ull h[MAXN];
ll h1[MAXN], h2[MAXN];
char st[MAXM];

inline ll MUL2(ll x,ll y){
    ll a=x*y-(ll)(1.L*x*y/mod2)*mod2;
    return (a%=mod2)<0?a+mod2:a;
}

inline ll MUL3(ll x, ll y){
    ll a = x * y - (ll)(1.L * x * y / mod3) * mod3;
    return (a %= mod3) < 0 ? a + mod3 : a;
}

signed main(){
#ifdef NICEGUODONG
    freopen("data.in","r",stdin);
#endif
    int n, m;
    scanf("%lld%lld", &n, &m);
    rep(i, 1, n){
        scanf("%s", st);
        int len = strlen(st);
        repd(j, len, 1){
            a[i][j] += st[len - j] - '0';
            if(j > m){
                a[i][j - m] += a[i][j];
                a[i][j] = 0;
            }
//                printf("%d ", a[i][j]);
        }
        
        rep(j, 1, m){
            a[i][j + 1] += a[i][j] / 10;
            a[i][j] %= 10;
        }
        while(a[i][m + 1]){
            a[i][1] += a[i][m + 1];
            a[i][m + 1] = 0;        
            rep(j, 1, m){
                a[i][j + 1] += a[i][j] / 10;
                a[i][j] %= 10;
            }
        }
//            puts("");
        repd(j, m, 1){
            h[i] = h[i] * 10 + a[i][j];
            h1[i] = (MUL2(h1[i], 10) + a[i][j]) % mod2;
            h2[i] = (MUL3(h2[i], 10) + a[i][j]) % mod3;
        }
//        printf("%d %d %d\n", h[i], h1[i], h2[i]);
    }
    ull c = 0, c1 = 0, c2 = 0;
    rep(i, 1, m){
        c = c * 10 + 9;
        c1 = (MUL2(c1, 10) + 9) % mod2;
        c2 = (MUL3(c2, 10) + 9) % mod3;
    }
    ull d = 2 * c, d1 = 2 * c1 % mod2, d2 = 2 * c2 % mod3;
    int ans = 0;
    rep(i, 1, n)
        rep(j, i + 1, n)
            rep(k, j + 1, n){
                if(h[i] + h[j] + h[k] == 0 && (h1[i] + h1[j] + h1[k]) % mod2 == 0 && (h2[i] + h2[j] + h2[k]) % mod3 == 0
                || h[i] + h[j] + h[k] == c && (h1[i] + h1[j] + h1[k]) % mod2 == c1 && (h2[i] + h2[j] + h2[k]) % mod3 == c2
                || h[i] + h[j] + h[k] == d && (h1[i] + h1[j] + h1[k]) % mod2 == d1 && (h2[i] + h2[j] + h2[k]) % mod3 == d2) ans++;
            }
    printf("%lld\n", ans);
    return 0;
}