# oj t -c "python3 main.py"
import sys,math
from collections import defaultdict,deque
from itertools import combinations,permutations,accumulate,product
from bisect import bisect,bisect_left,bisect_right
from heapq import heappop,heappush,heapify
#from sortedcontainers import SortedList,SortedSet
def input(): return sys.stdin.readline().rstrip()
def ii(): return int(input())
def ms(): return map(int, input().split())
def li(): return list(map(int,input().split()))
inf = pow(10,18)
#////////////////////////////////////
N,P,Q = ms()
A = li()
A.sort()
ans = 0
dicA = dict()
dicB = dict()
dicC = dict()
dicD = dict()
for a in A:
  dicA[a] = pow(10,a)%P
  dicB[a] = pow(9,a)%P
  dicC[a] = pow(7,a)%P
  dicD[a] = pow(5,a)%P
  
for a,b,c,d in combinations(A,4):
  tmp = dicA[a]+dicB[b]+dicC[c]+dicD[d]
  if tmp%P==Q: ans += 1
  
print(ans)