This is the easy version of the problem. The only difference is that in this version k = 0.

There is an array a_1, a_2, …, a_n of n positive integers. You should divide it into a minimal number of continuous segments, such that in each segment there are no two numbers (on different positions), whose product is a perfect square.

Moreover, it is allowed to do at most k such operations before the division: choose a number in the array and change its value to any positive integer. But in this version k = 0, so it is not important.

What is the minimum number of continuous segments you should use if you will make changes optimally?

Input

The first line contains a single integer t (1 ≤ t ≤ 1000) — the number of test cases.

The first line of each test case contains two integers n, k (1 ≤ n ≤ 2 ⋅ 10^5, k = 0).

The second line of each test case contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^7).

It's guaranteed that the sum of n over all test cases does not exceed 2 ⋅ 10^5.

Output

For each test case print a single integer — the answer to the problem.

Example

Input


3
5 0
18 6 2 4 1
5 0
6 8 1 24 8
1 0
1


Output


3
2
1

Note

In the first test case the division may be as follows:

  * [18, 6] 
  * [2, 4] 
  * [1] 

import java.util.*;
import java.io.*;

public class SquarefreedivisionEasy {

	// https://codeforces.com/contest/1497/problem/E1
	
	public static void main(String[] args) throws IOException, FileNotFoundException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		//BufferedReader in = new BufferedReader(new FileReader("SquarefreedivisionEasy"));
		
		sieve();
		ArrayList<Integer> squares = new ArrayList<>();
		for (int i=2; i*i<(int)(1e7+1); i++) {
			if (sieve[i] == i) squares.add(i*i);
		}
		
		StringBuilder sb = new StringBuilder();
		int t = Integer.parseInt(in.readLine());
		while (t-- > 0) {
			StringTokenizer st = new StringTokenizer(in.readLine());
			int n = Integer.parseInt(st.nextToken());
			int k = Integer.parseInt(st.nextToken());
					//k=0
			st = new StringTokenizer(in.readLine());
			int[] arr = new int[n];
			for (int i=0; i<n; i++) {
				arr[i] = Integer.parseInt(st.nextToken());
				
				for (int j=0; j<squares.size() && arr[i] >= squares.get(j); j++) {
					while (arr[i] % squares.get(j) == 0) {
						arr[i] /= squares.get(j);
					}
				}
			}
			
			HashSet<Integer> included = new HashSet<>();
			int c=0;
			for (int i=0; i<n; i++ ) {
				if (included.contains(arr[i])) {
					c++;
					included.clear();
				}
				included.add(arr[i]);
			}
			
			sb.append(c+1 + "\n");
			
		}
		System.out.print(sb);
	}
	
	static int max = (int)4e3;
	static int[] sieve = new int[max];

	public static void sieve() {
		for (int i=2; i<max; i++) {
			sieve[i] = i;
		}
		for (int i=4; i<max; i+=2) {
			sieve[i] = 2;
		}
		for (int i=3; i*i <max; i+=2) {
			if (sieve[i] == i) {
				for (int j= i*i; j < max; j+= i) {
					sieve[j] = i;
				}
			}
		}
	}
}