#include "bits/stdc++.h"
#define rep(i, a, n) for (auto i = a; i <= (n); ++i)
#define revrep(i, a, n) for (auto i = n; i >= (a); --i)
#define all(a) a.begin(), a.end()
#define sz(a) (int)(a).size()
template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, T b) { if (b < a) { a = b; return 1; } return 0; }
using namespace std;
 
template<class A, class B> string to_string(const pair<A, B> &p);
template<class A, class B, class C> string to_string(const tuple<A, B, C> &p);
template<class A, class B, class C, class D> string to_string(const tuple<A, B, C, D> &p);
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string) s); }
string to_string(char c) { return "'" + string(1, c) + "'"; }
string to_string(bool x) { return x ? "true" : "false"; }
template<size_t L> string to_string(const bitset<L> &x) { return x.to_string(); }
template<class A, class T = typename A::value_type> string to_string(const A &v) {
	bool first = 1;
	string res = "{";
	for (const auto &x: v) {
		if (!first) res += ", ";
		first = 0;
		res += to_string(x);
	}
	res += "}";
	return res;
}
template<class A, class B> string to_string(const pair<A, B> &p) {
	return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template<class A, class B, class C> string to_string(const tuple<A, B, C> &p) {
	return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template<class A, class B, class C, class D> string to_string(const tuple<A, B, C, D> &p) {
	return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << endl; }
template<class H, class... T> void debug_out(const H& h, const T&... t) {
	cerr << " " << to_string(h);
	debug_out(t...);
}
#ifndef ONLINE_JUDGE
	#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
	#define debug(...) if (0) puts("No effect.")
#endif

using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;

/**
 * Author: Yuhao Yao
 * Date: 23-05-01
 * Description: Hash struct. $1000000007$ and $1000050131$ are good moduli.
 * Status: tested on https://ac.nowcoder.com/acm/contest/33192/I, https://ac.nowcoder.com/acm/contest/33193/I.
 */
template<int m1, int m2>
struct Hash {
	int x, y;
	Hash(ll a, ll b) : x(a % m1), y(b % m2) {
		if (x < 0) x += m1;
		if (y < 0) y += m2;
	}
	Hash(ll a = 0) : Hash(a, a) {}

	using H = Hash;
	static int norm(int x, int mod) { return x >= mod ? x - mod : x < 0 ? x + mod : x; }
	H& operator +=(H b) { x = norm(x + b.x, m1); y = norm(y + b.y, m2); return *this; }
	H& operator -=(H b) { x = norm(x - b.x, m1); y = norm(y - b.y, m2); return *this; }
	H& operator *=(H b) { x = 1ll * x * b.x % m1; y = 1ll * y * b.y % m2; return *this; }
	friend H operator +(H a, H b) { return a += b; }
	friend H operator -(H a, H b) { return a -= b; }
	friend H operator *(H a, H b) { return a *= b; }
	
	friend bool operator ==(H a, H b) { return tie(a.x, a.y) == tie(b.x, b.y); }
	friend bool operator !=(H a, H b) { return tie(a.x, a.y) != tie(b.x, b.y); }
	friend bool operator <(H a, H b) { return tie(a.x, a.y) < tie(b.x, b.y); }

	friend string to_string(H a) { return to_string(make_pair(a.x, a.y)); }
};


int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	using hashv = Hash<1000000007, 1000050131>;

	int n, k; cin >> n >> k;
	vector<hashv> hs(n);
	for (auto &h : hs) {
		string s; cin >> s;
		reverse(all(s));
		vector<int> as(k);
		rep(i, 0, sz(s) - 1) {
			int x = s[i] - '0';
			as[i % k] += x;
		}
		
		for (int i = 0, cnt = 0; cnt < k; i = (i + 1) % k) {
			if (as[i] < 10) {
				cnt++;
			} else {
				int x = as[i] / 10;
				as[i] %= 10;
				as[(i + 1) % k] += x;
				cnt = 0;
			}
		}
		reverse(all(as));
		for (auto x : as) h = h * 10 + x;
		if (count(all(as), 9) == k) h = 0;
	}
	hashv full = 0;
	rep(i, 1, k) full = full * 10 + 9;
	hashv full2 = full * 2;
	int ans = 0;
	rep(i, 0, n - 1) rep(j, i, n - 1) rep(k, j, n - 1) {
		hashv h = hs[i] + hs[j] + hs[k];
		if (h == 0 || h == full || h == full2) ans++;
	}
	printf("%d\n", ans);
	return 0;
}