import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
#input = sys.stdin.readline
n,p,q = map(int,input().split())
a = list(map(int,input().split()))
a.sort()
ans = 0
x = [[] for i in range(p)]
for i in range(n):
    x[pow(5,a[i],p)].append(i)
ten = [pow(10,a[i],p) for i in range(n)]
nine = [pow(9,a[i],p) for i in range(n)]
seven = [pow(7,a[i],p) for i in range(n)]
for i in range(n):
    for j in range(i+1,n):
        for k in range(j+1,n):
            z = ten[i] + nine[j] + seven[k]
            z %= p
            r = (q - z) % p
            ans += len(x[r]) - bisect.bisect_right(x[r],k)
print(ans)