#include<bits/stdc++.h>

using namespace std;

#define ll int

#define maxn 200005

ll n,k,a[maxn];

map<ll,ll>mp[];

int main(){

    cin>>n>>k;

    for(int i=;i<=n;i++){

        scanf("%d",&a[i]);

        ll tmp=a[i],len=;

        while(tmp)len++,tmp/=;

        mp[len][a[i]%k]++;

    }

    ll ans=;

    for(int i=;i<=n;i++){

        ll tmp=a[i],tmp2=a[i],len=;

        while(tmp2)len++,tmp2/=;

        for(int j=;j<=;j++){

            tmp=tmp*%k;

            ans+=mp[j][(k-tmp)%k];

            if(j==len && a[i]%k==(k-tmp)%k)ans--;

        }

    }

    cout<<ans<<endl;

}

#include <bits/stdc++.h>

#define forn(i, n) for (int i = 0; i < int(n); i++)

typedef long long li;

using namespace std;

const int N =  *  + ;

const int LOGN = ;

int n, k;

int a[N];

int len[N];

vector<int> rems[LOGN];

int pw[LOGN];

int main() {

    scanf("%d%d", &n, &k);

    forn(i, n) scanf("%d", &a[i]);

    pw[] = ;

    forn(i, LOGN - )

        pw[i + ] = pw[i] *  % k;

    forn(i, n){

        int x = a[i];

        while (x > ){

            ++len[i];

            x /= ;

        }

        rems[len[i]].push_back(a[i] % k);

    }

    forn(i, LOGN)

        sort(rems[i].begin(), rems[i].end());

    li ans = ;

    forn(i, n){

        for (int j = ; j < LOGN; ++j){

            int rem = (a[i] * li(pw[j])) % k;

            int xrem = (k - rem) % k;

            auto l = lower_bound(rems[j].begin(), rems[j].end(), xrem);

            auto r = upper_bound(rems[j].begin(), rems[j].end(), xrem);

            ans += (r - l);

            if (len[i] == j && (rem + a[i] % k) % k == )

                --ans;

        }

    }

    printf("%lld\n", ans);

    return ;

}