You are given an array consisting of $$N$$ integers. You need to determine whether any permutation of given array exist such that the sum of all subarrays of length $$K$$ are equal.

Input format :

• The first line consist of $$T$$ denoting the number of testcases.
• The first line of each testcase consist of two space seperated integers $$N$$ and $$K$$.
• The second line of each testcase consist of $$N$$ space seperated integers denoting array elements.

Output format :

• Print "YES" or "NO" for each testcase in a new line.

Constraints :

• \(1 \le T \le 10 \)
• \(1 \le K \le N \le 10^{6}\)
• \(1 \le A_{i} \le 10^{5}\)
• $$N$$ is divisible by $$K$$  i.e \(N\mod K=0\)