#include <bits/stdc++.h>
#ifdef memset0
#define log(...) fprllf(stderr, __VA_ARGS__)
#else
#define log(...) (void(0))
#define endl '\n'
#endif
using namespace std;

/*

#include <bits/stdc++.h>
#ifdef memset0
#define log(...) fprllf(stderr, __VA_ARGS__)
#else
#define log(...) (void(0))
#define endl '\n'
#endif
using namespace std;#include <bits/stdc++.h>
#ifdef memset0
#define log(...) fprllf(stderr, __VA_ARGS__)
#else
#define log(...) (void(0))
#define endl '\n'
#endif
using namespace std;#include <bits/stdc++.h>
#ifdef memset0
#define log(...) fprllf(stderr, __VA_ARGS__)
#else
#define log(...) (void(0))
#define endl '\n'
#endif
using namespace std;

*/

typedef long long ll;

const ll N = 400;
const ll p1 = 998244353, p2 = 1e9 + 7, p3 = 1e9 + 9, p4 = 1e9 + 21, p5 = 1e9 + 33, p6 = 999999937;
ll n, m;
map<ll, vector<ll>> a;

struct hashing {
  ll a, b, c, d, e, f;
  hashing() : a(0), b(0), c(0), d(0), e(0), f(0) {}
  void operator+=(const hashing &rhs) {
    a += rhs.a;
    b += rhs.b;
    c += rhs.c;
    d += rhs.d;
    e += rhs.e;
    f += rhs.f;
    if (a >= p1) a -= p1;
    if (b >= p2) b -= p2;
    if (c >= p3) c -= p3;
    if (d >= p4) d -= p4;
    if (e >= p5) e -= p5;
    if (f >= p6) f -= p6;
  }
  void upd(ll x) {
    a = (a * 10ll + x) % p1;
    b = (b * 10ll + x) % p2;
    c = (c * 10ll + x) % p3;
    d = (d * 10ll + x) % p4;
    e = (e * 10ll + x) % p5;
    f = (f * 10ll + x) % p6;
  }
  bool operator==(const hashing &rhs) const { return a == rhs.a && b == rhs.b && c == rhs.c && d == rhs.d && e == rhs.e && f == rhs.f; }
} h[N];

void solve_mod(vector<ll> &a) {
  if (a.size() < m) {
    a.resize(m);
  }
  while (a.size() > m) {
    for (ll i = m; i < a.size(); i++) {
      a[i % m] += a[i];
      a[i] = 0;
    }
    for (ll i = 0; i + 1 < a.size(); i++) {
      a[i + 1] += a[i] / 10;
      a[i] %= 10;
    }
    while (a.size() > m && a.back() == 0) a.pop_back();
  }
  for (ll i = 0; i < a.size(); i++)
    if (a[i] != 9) return;
  for (ll i = 1; i < a.size(); i++) a[i] = 0;
}

int main() {
#ifdef memset0
  freopen("M.in", "r", stdin);
#endif
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> m;
  for (ll i = 0; i < n; i++) {
    string s;
    cin >> s;
    for (ll j = (ll)s.length() - 1; j >= 0; j--) {
      a[i].push_back(s[j] - '0');
    }
    solve_mod(a[i]);
    // for (ll x : a[i]) log("%d,", x);
    // log("\n");
    for (ll j = m; j >= 0; j--) {
      h[i].upd(a[i][j]);
    }
    // log("%u %u %u\n", h[i].a, h[i].b, h[i].c);
  }
  hashing tg0, tg1, tg2;
  for (ll i = 0; i < m; i++) {
    tg1.upd(9);
  }
  tg2 = tg1, tg2 += tg1;
  // log("tg1 = %u %u %u\n", tg1.a, tg1.b, tg1.c);
  // log("tg2 = %u %u %u\n", tg2.a, tg2.b, tg2.c);
  ll ans = 0;
  for (ll i = 0; i < n; i++) {
    hashing u = h[i];
    for (ll j = i; j < n; j++) {
      hashing v = h[j];
      v += u;
      for (ll k = j; k < n; k++) {
        hashing w = h[k];
        w += v;
        // log("%d %d %d : %u %u %u\n", i, j, k, w.a, w.b, w.c);
        if (w == tg0 || w == tg1 || w == tg2) {
          ++ans;
        }
      }
    }
  }
  cout << ans << endl;
}