#include <bits/stdc++.h>
using namespace std;

long long mod = 998244353;
//入力が必ずmod未満の時に使う.
struct mint{
    long long v = 0;
    mint(){} mint(int a){v = a;} mint(long long a){v = a;} mint(unsigned long long a){v = a;}
    long long val(){return v;}
    void modu(){v %= mod;}
 
    mint repeat2mint(long long a,long long b){
        mint ret = 1,p = a;
        while(b){if(b&1) ret *= p; p *= p; b >>= 1;}
        return ret;
    };
 
    mint operator-(){return mint(0)-mint(v);}
    mint operator+(mint b){return (v+b.v)%mod;}
    mint operator-(mint b){return (v-b.v+mod)%mod;}
    mint operator*(mint b){return v*b.v%mod;}
    mint operator/(mint b){
        if(b.v == 0) assert(false);
        return v*(repeat2mint(b.v,mod-2)).v%mod;
    }
 
    void operator+=(mint b){v = (v+b.v)%mod;}
    void operator-=(mint b){v = (v-b.v+mod)%mod;}
    void operator*=(mint b){v = v*b.v%mod;}
    void operator/=(mint b){
    if(b.v == 0) assert(false);
        v = v*repeat2mint(b.v,mod-2).v%mod;
    }
 
    void operator++(int){v = (v+1)%mod; return;}
    void operator--(int){v = (v-1+mod)%mod; return;}
    bool operator==(mint b){return v == b.v;}
    bool operator!=(mint b){return v != b.v;}
    bool operator>(mint b) {return v >  b.v;}
    bool operator>=(mint b){return v >= b.v;}
    bool operator<(mint b) {return v <  b.v;}
    bool operator<=(mint b){return v <= b.v;}
 
    mint pow(long long x){return repeat2mint(v,x);}
    mint inv(){return mint(1)/v;}
};			

int main() {
    int N,Q; cin >> N >> mod >> Q;
    vector<int> A(N);
    for(auto &a : A) cin >> a;

    vector<vector<int>> Rmod(N);
    vector<int> add(100000);
    for(int i=N-1; i>=0; i--) add.at(mint(5).pow(A.at(i)).v)++,Rmod.at(i) = add;

    int answer = 0;
    for(int i=0; i<N; i++){
        mint a = mint(10).pow(A.at(i));
        for(int k=i+1; k<N; k++){
            mint b = mint(9).pow(A.at(k));
            for(int l=k+1; l<N-1; l++){
                mint c = mint(7).pow(A.at(l));
                int now = (Q-(a+b+c).v+mod)%mod;
                answer += Rmod.at(l+1).at(now);
            }
        }
    }
    cout << answer << endl;
}