B. Sum of Medians

https://codeforces.ml/contest/1440/problem/B

A median of an array of integers of length nn is the number standing on the ⌈n2⌉⌈n2⌉ (rounding up) position in the non-decreasing ordering of its elements. Positions are numbered starting with 11. For example, a median of the array [2,6,4,1,3,5][2,6,4,1,3,5] is equal to 33. There exist some other definitions of the median, but in this problem, we will use the described one.

Given two integers nn and kk and non-decreasing array of nknk integers. Divide all numbers into kk arrays of size nn, such that each number belongs to exactly one array.

You want the sum of medians of all kk arrays to be the maximum possible. Find this maximum possible sum.

Input

The first line contains a single integer tt (1≤t≤1001≤t≤100) — the number of test cases. The next 2t2t lines contain descriptions of test cases.

The first line of the descr