#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

using ll = long long;
using ld = long double;
using ull = unsigned long long;

template <typename T> bool chmin(T &a, const T &b) {
    if (a <= b) return false;
    a = b;
    return true;
}
template <typename T> bool chmax(T &a, const T &b) {
    if (a >= b) return false;
    a = b;
    return true;
}

using namespace std;

// isprime
bool isprime(ll n){
	if (n == 1) return false;
	for (ll i = 2; i * i <= n; i++){
		if (n % i == 0) return false;
	}
	return true;
}

ll mod_pow(ll x, ll m, int P){
	ll ret = 1;
	ll tmp = x;
	while (m > 0){
		if (m&1){
			ret = ret * tmp % P;
		}
		m >>= 1;
		tmp = tmp * tmp % P;
	}
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int n, k; cin >> n >> k;
	vector<string> s(n);
	rep(i,0,n){
		cin >> s[i];	
	}

	auto naosu = [&](string t) -> vector<int> {
		int pr = (int)t.size();
		int pl = (int)t.size() - k;
		vector<int> ret(k, 0);
		while(pr > 0){
			vector<int> tmp(k, 0);
			rep(i,max(0,pl),pr){
				tmp[i-pl] = t[i] - '0';
			}
			int over = 0;
			int gogo = 0;
			rrep(i,0,k){
				gogo = ret[i] + tmp[i] + over;
				if (gogo >= 10){
					gogo -= 10;
					over = 1;
				}else{
					over = 0;
				}
				ret[i] = gogo;
			}
			if (over == 1){
				rrep(i,0,k){
					gogo = ret[i] + over;
					if (gogo >= 10){
						gogo -= 10;
						over = 1;
					}else{
						over = 0;
					}
					ret[i] = gogo;
				}
			}
			pr -= k;
			pl -= k;
		}
		return ret;
	};

	vector<vector<int>> gar;
	rep(i,0,n){
		gar.push_back(naosu(s[i]));
		/*
		rep(j,0,k){
			cout << gar[i][j];
		}
		cout << endl;
		*/
	}

	random_device seed_gen;
	mt19937 engine(seed_gen());
	uniform_int_distribution<int> dist((int)5e8, (int)1e9);

	const int numpy = 6;
	vector<int> pls(numpy);
	rep(i,0,numpy){
		do {
			pls[i] = dist(engine);
		}while(!isprime(pls[i]));
	}

	vector<vector<ll>> hashl(n, vector<ll>(numpy));
	rep(i,0,n){
		rep(p,0,numpy){
			ll tmp = 0;
			rep(j,0,k){
				tmp = tmp * 10 + gar[i][j];
				tmp %= pls[p];
			}
			hashl[i][p] = tmp;
		}
	}

	vector miru(4, vector<ll>(numpy));
	rep(i,0,numpy){		
		miru[1][i] = (mod_pow(10, k, pls[i]) + 2 * pls[i] - 1) % pls[i];
		miru[2][i] = miru[1][i] * 2 % pls[i];
		miru[3][i] = miru[1][i] * 3 % pls[i];
	}

	ll cnt = 0;
	rep(j,0,n){
		map<vector<int>,int> mp;
		rep(i,0,j+1){
			vector<int> arg(numpy);
			rep(p,0,numpy){
				ll t = hashl[i][p] + hashl[j][p];
				t %= pls[p];
				arg[p] = t;
			}
			mp[arg]++;
		}
		rep(k,j,n){
			rep(d,0,4){
				vector<int> arg(numpy);
				rep(p,0,numpy){
					ll t = hashl[k][p];
					arg[p] = miru[d][p] - t;
				}
				cnt += mp[arg];
			}
		}
	}
	
	cout << cnt << '\n';
	
}