#include <iostream>

#include <stdio.h>

#include <string.h>

#include <algorithm>

#include <math.h>

#include <vector>

#include <map>

#include <string>

using namespace std;

#define INF 0x3f3f3f3f

#define met(a, b) memset(a, b, sizeof(a))

#define N 200005

typedef long long LL;

int main()

{

    int n;

    LL  k, a[N];

    while(scanf("%d %I64d", &n, &k)!=EOF)

    {

        map<LL, LL> mp1, mp2;

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

        {

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

            mp1[a[i]]++;

        }

        LL ans = ;

        for(int i=n; i>=; i--)///倒着来便于统计mp2[x]的个数，即倒着来的数的个数；

        {

            mp1[a[i]] --;///正着来的要减减；

            if(a[i]%k==)

                ans += mp1[a[i]/k] * mp2[a[i]*k];

            mp2[a[i]] ++;

        }

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

    }

    return ;

}

LL a[maxn], b[maxn], l[maxn], r[maxn], n, m;

LL bin_sreach (LL x)

{

    LL high = m-, low = ;

    while (high >= low)

    {

        LL mid = (high + low) / ;

        if (b[mid] == x)

            return mid;

        if (b[mid] < x)

            low = mid + ;

        else

            high = mid -;

    }

    return n;

}

int main ()

{

    LL k;

    while (scanf ("%I64d %I64d", &n, &k) != EOF)

    {

        for (LL i=; i<n; i++)

        {

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

            b[i] = a[i];

        }

        sort (b, b+n);

        m = unique(b, b+n) - b;

        memset (l, , sizeof(l));

        memset (r, , sizeof(r));

        for (LL i=; i<n; i++)

        {

            LL x = bin_sreach(a[i]);

            l[x] ++;

        }

        __int64 ans = ;

        for (LL i=n-; i>=; i--)

        {

            LL x, y, z;

            x = y = n;

            z = bin_sreach(a[i]);

            l[z] --;

            if (a[i] % k == )

                x = bin_sreach(a[i]/k);

            y = bin_sreach(a[i]*k);

            ans += l[x] * r[y];

            r[z] ++;

        }

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

    }

    return ;

}