from itertools import combinations


def main():
    N, P, Q = map(int, input().split())
    A = sorted(map(int, input().split()))
    divisors = [10, 9, 7, 5]
    A_mod = [[pow(div_, a_elm, P) for div_ in divisors] for a_elm in A]
    ctr = 0
    for idxs in combinations(range(N), r=4):
        if sum(A_mod[idx][idx2] for idx, (idx2, div_)
               in zip(idxs, enumerate(divisors))) % P == Q:
            ctr += 1
    print(ctr)


if __name__ == "__main__":
    main()