from collections import Counter

def solve(n, p, q, a):
  b = sorted(a)
  pow10 = [pow(10, x, p) for x in b]
  pow9 = [pow(9, x, p) for x in b]
  pow7 = [pow(7, x, p) for x in b]
  pow5 = [pow(5, x, p) for x in b]
  cnt = Counter()
  ans = 0
  for i in range(n):
    for j in range(i + 1, n):
      for k in range(j + 1, n):
        x = pow9[i] + pow7[j] + pow5[k]
        ans += cnt[(q - x) % p]
    cnt[pow10[i]] += 1
  return ans

n, p, q = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]

print(solve(n, p, q, a))