#include <bits/stdc++.h>
using namespace std;
using ll = long long ;
const int N = 1e5 + 50;
int ksm(int a,int b,int c) {
int ans = 1;
while (b) {
if (b&1) ans = ans * b % c;
a = a * a % c;
b >>= 1;
}
return ans;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n,p,k; cin >> n >> p >> k;
int ans = 0;
for (int i = 1;i <= n; i++) {
int x; cin >> x;
ans = (ans + k * ksm(x,p-2,p) % p)%p;
k = k * k % p;
}
cout << ans % p << " " ;
return 0;
}