#include <bits/stdc++.h>
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
const int inf = 0x3f3f3f3f, Inf = 0x7fffffff;
const long long INF = 0x7ffffffffffffff;
const double eps = 1e-8;
unsigned int seed = 19260817;
__inline__ __attribute__((always_inline)) unsigned int Rand() {
  return seed = seed * 998244353u + 1000000007u;
}
template <typename _Tp>
_Tp gcd(const _Tp &a, const _Tp &b) {
  return (!b) ? a : gcd(b, a % b);
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) _Tp abs(const _Tp &a) {
  return a > 0 ? a : -a;
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) _Tp max(const _Tp &a, const _Tp &b) {
  return a < b ? b : a;
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) _Tp min(const _Tp &a, const _Tp &b) {
  return a < b ? a : b;
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) void chmax(_Tp &a, const _Tp &b) {
  (a < b) && (a = b);
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) void chmin(_Tp &a, const _Tp &b) {
  (a > b) && (a = b);
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) bool _cmp(const double &a,
                                                    const double &b) {
  return abs(a - b) <= eps;
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) void read(_Tp &x) {
  register char ch(getchar());
  bool f(false);
  while (ch < 48 || ch > 57) f |= ch == 45, ch = getchar();
  x = ch & 15, ch = getchar();
  while (ch >= 48 && ch <= 57)
    x = (((x << 2) + x) << 1) + (ch & 15), ch = getchar();
  if (f) x = -x;
}
template <typename _Tp, typename... Args>
__inline__ __attribute__((always_inline)) void read(_Tp &t, Args &...args) {
  read(t);
  read(args...);
}
__inline__ __attribute__((always_inline)) int read_str(char *s) {
  register char ch(getchar());
  while (ch < 65 || ch > 122 || (ch > 90 && ch < 97)) ch = getchar();
  register char *tar = s;
  *tar = ch, ch = getchar();
  while ((ch >= 65 && ch <= 90) || (ch >= 97 && ch <= 122))
    *(++tar) = ch, ch = getchar();
  return tar - s + 1;
}
const int N = 200005;
struct custom_hash {
  __inline__ __attribute__((always_inline)) static uint64_t splitmix64(
      uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  __inline__ __attribute__((always_inline)) size_t operator()(
      uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        std::chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
int a[N];
std::unordered_map<long long, int, custom_hash> mp[11];
int len[N];
int main() {
  int n, k;
  read(n, k);
  for (int i = 1; i <= n; ++i) {
    read(a[i]);
    int x = a[i];
    while (x) {
      ++len[i];
      x /= 10;
    }
    a[i] %= k;
  }
  long long ans = 0;
  for (int i = 1; i <= n; ++i) {
    int tmp = 10;
    for (int _ = 1; _ <= 10; ++_) {
      long long t = (k - 1ll * a[i] * tmp % k) % k;
      if (mp[_].find(t) != mp[_].end()) ans += mp[_][t];
      tmp = tmp * 10 % k;
    }
    ++mp[len[i]][a[i]];
  }
  for (int i = 1; i <= 10; ++i) mp[i].clear();
  for (int i = n; i >= 1; --i) {
    int tmp = 10;
    for (int _ = 1; _ <= 10; ++_) {
      long long t = (k - 1ll * a[i] * tmp % k) % k;
      if (mp[_].find(t) != mp[_].end()) ans += mp[_][t];
      tmp = tmp * 10 % k;
    }
    ++mp[len[i]][a[i]];
  }
  printf("%lld\n", ans);
  return 0;
}
