#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll sz = 1e7 + 1;

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL); cout.tie(NULL);
	int t;
	cin >> t;
	ll sz = 1e7 + 1;
	vector<int> is_prime(sz);
	for(ll i = 2; i * i < sz; i++)
	{
	     if(is_prime[i] == 0){
	          for(ll j = i*i; j < sz; j+=i)
	          {
	               is_prime[j] = 1;   
	          }
	     }
	}
	//cout << is_prime[9] << "\n";
	while(t--)
	{
	     int n,k;
	     cin >> n >> k;
	     vector<ll> a(n);
	     for(int i = 0; i < n; i++) cin >> a[i];
	     for(int i = 0; i < n; i++)
	     {
	          ll mask = 1;
	          if(is_prime[a[i]]==0) continue;
	          for(ll j = 2; j*j <= a[i]; j++)
	          {
	               if(a[i] % j == 0)
	               {
	                    ll cnt = 0;
	                    ll one = j, two = a[i]/j;
	                    while(a[i]%one == 0)
	                    {
	                         a[i]/=one;
	                         cnt++;
	                    }
	                    //cout << j << " "<< i << " " << cnt << "\n";
	                    if(cnt % 2) mask *= one;
	               }
	              // cout << a[i] << "\n";
	               if(is_prime[a[i]]==0) break;
	          }
	          a[i] *= mask;
	     }
	     //cout << is_prime[9999998];
	     ll ans = 0, last = 1;
	     map<ll,ll> pres;
	     for(int i = 0; i < n; i++)
	     {
	          //cout << a[i] << " ";
	          if(pres[a[i]]>=last){
	               last = i+1;
	               ans++;
	          }
	          pres[a[i]] = i+1;
	     }
	     ans++;
	     cout << ans << "\n";
	}
	return 0;
}