Sgu 117

117. Counting

time limit per test: 0.25 sec. memory limit per test: 4096 KB

 

Find amount of numbers for given sequence of integer numbers such that after raising them to the M-th power they will be divided by K.

 

Input

Input consists of two lines. There are three integer numbers N, M, K (0<N, M, K<10001) on the first line. There are N positive integer numbers − given sequence (each number is not more than 10001) − on the second line.

 

Output

Write answer for given task.

 

Sample Input

4 2 50
9 10 11 12

Sample Output

1

---

Author	: Michael R. Mirzayanov
Resource	: PhTL #1 Training Contests
Date	: Fall 2001

#pragma comment(linker,"/STACK:102400000,102400000")
#include <cstdio>
#include <vector>
#include <cmath>
#include <queue>
#include <set>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define INF 0x7fffffff 
#define mod 1000000007
#define ll long long
#define maxn 100025
#define pi acos(-1.0)
int n, m, k;
ll Pow(ll a, ll b){
    ll res = 1;
    while (b){
        if (b & 1)res = (res*a) % k;
        a = (a*a) % k;
        b >>= 1;
    }
    return res;
}
int main(){
    int t=0, x;
    scanf("%d%d%d", &n,&m,&k);
    for (int i = 0; i < n; i++){
        scanf("%d", &x);
        if (Pow(x, m) == 0)t++;
    }
    printf("%d\n", t);
    return 0;
}