jijuxieAC

#include<iostream>
#include<iomanip>
#include<cmath> 
#include<string>
#include<algorithm> 
#include<cstdio>
#include<map>
#define ll long long
using namespace std;
const int N=5e5+10;
ll a[N]; 
map<ll,int>mp;
int main(){
	ll n,k,t;
	scanf("%lld",&t);
	while(t--){
		scanf("%lld%lld",&n,&k);
		for(int i=1;i<=n;i++){
			scanf("%lld",&a[i]);
			mp[a[i]]++;
		}
		sort(a+1,a+1+n);
		for(int i=1;i<=n;i++){
			if(k==1){
				if(mp[a[i]]>1){
					mp[a[i]]-=2;
				}
				}else if(mp[a[i]]>=1&&mp[a[i]*k]>=1){
					mp[a[i]*k]--;
					mp[a[i]]--;
				}
		}
			ll cnt=0;
			map<ll,int>::iterator it;
			for(it=mp.begin();it!=mp.end();it++){
				if(it->second>=1){
					cnt+=it->second;
				}
			}
			printf("%lld\n",cnt);
			mp.clear();
		} 
	
	return 0;
}