# Challenges

Problem Statement

There is a road of N blocks and at each block, there is tree represented by a number. Groot is standing at the 1st block and he can see only K blocks ahead of him(including the standing block) and he starts walking block by block. Print distinct number of trees visible to Groot at each block. Groot will stop walking when the last tree becomes visible to him.

Input

First Line of the input contains an integer T denoting the number of test cases. The first line of each test case contains N and K. Next Line contains N space separated integers denoting types of tree.

Output

For each test case print visible number of distinct tree at each block separated by space in a separate line.

Constraints

1<=T<=10
1<=N<=100
1<=K<=N.

Sample Input

1 7 4 1 2 1 3 4 2 3

Sample Output

3 4 4 3

Dcoded By: Bhanu Nadar

Solved By: 196

Maximum Marks: 15