You are given two numbers N and K and a set X.

X = { x : x is a natural number ≤ N }
You have to find the total number of pairs of elements X[i] and X[j] belonging to the given set, such that, i < j and their sum is divisible by K.

Input Format:

An integer T followed by T lines, each containing a pair of space separated integers N and K.

Output Format:

T integers on separate lines. Each integer denotes the answer corresponding to that test case.

Constraints:

1≤T≤100

K≤N≤10^9

1≤K≤10000

SAMPLE INPUT
2
10 4
7 3

SAMPLE OUTPUT
10
7

Explanation

For the 1st test case, there are 10 pairs whose sum is divisible by 4.
(1,3), (1,7), (2,6), (2,10), (3,5), (3,9), (4,8), (5,7), (6,10) and (7,9)

For the 2nd test case, there are 7 pairs whose sum is divisible by 3.
(1,2), (1,5), (2,4), (2,7), (3,6), (4,5) and (5,7)
Register for IndiaHacks

见题面

见题面