#include<bits/stdc++.h>
#define yes "YES"
#define no "NO"
#define vi vector<int>
#define vii vector<vector<int>>
using namespace std;
#define int long long
#define tezi ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(v) v.begin(),v.end()
#define fi first
#define se second
#define pb push_back
#define PI 3.1415926535
#define INF             2000000000000000000
#define display(a) for(int i=0;i<a.size();i++) cout<<a[i]<<' '; cout<<endl;
#define showarray(a,n) for(int i=0;i<n;i++) cout<<a[i]<<' ';cout<<endl;
#define countsetbits(x)     __builtin_popcountll(x)
#define mem(a,b)            memset(a,b,sizeof(a))
#define dbg(x)      cout << #x << "is" << x << endl;
#define f                   first
#define s                   second
#define ci                  cin>>
#define co                  cout<<
typedef pair<int,int>           pii;
int prime[1000005];
void prime_sieve()
{
    for (int i = 0; i <= 1000005;i++)
    {
     prime[i] = 1;
    }
     prime[0] = prime[1] = 0;
    for (int i = 1; i*i <= 1000005;i++)
   {
    if(prime[i]==1)
    {
    for (int j = 2 * i; j <= 1000005;j+=i)
    {
    prime[j] = 0;
    }
    }
    }
}
int cntsetbits(int n)
{
int cnt = 0;
while(n>0)
{
    cnt++;
    int rsb_mask = (n & (-n));
    n = n - rsb_mask;
 }
return cnt;
}
vi read(int n)
{
vi a(n);
for (int i = 0; i < n;i++)
{
cin>> a[i];
}
 return a;
}
bool isprime(int n){if(n==1){return false;} for(int i=2;i<=sqrt(n);i++){if(n%i==0){return false;} }return true;}
bool isperfectsquare(int n) { int y = sqrt(n); if(n==y*y){return true;}return false;}
vi factors;
void primefactors(int n){for(int i=1;i<=sqrt(n);i++){if(n%i==0){if(isprime(i)){factors.push_back(i);}if(isprime(n/i)){factors.push_back(n/i);}}}}
 
void _timelimitExceeded_ ()
{
    int n, x;
    cin >> n >> x;
    vi a = read(n);
    map<int, int> m;
    for (int i = 0; i < n;i++)
    {
        m[a[i]]++;
    }
    int cnt = 0;
    for(auto it:m)
    {
        int a = it.first;
        int ac = it.second;
        int b = a * x;
        int bc = m[b];
        if(bc!=ac)
        {
            if(ac>bc)
            {
                cnt += (ac - bc);
                m[a] = 0;
                m[b] = 0;
            }else{
                m[b] -= ac;
                m[a] = 0;
            }
        }else{
            m[a] = 0;
            m[b] = 0;
        }
           
    }
    cout << cnt << endl;
}
signed main(){
tezi
int t;
cin>>t;
while(t--)
{
_timelimitExceeded_ ();
}
    return 0;
}