B. Candies Division

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Santa has nn candies and he wants to gift them to kk kids. He wants to divide as many candies as possible between all kk kids. Santa can't divide one candy into parts but he is allowed to not use some candies at all.

Suppose the kid who recieves the minimum number of candies has aa candies and the kid who recieves the maximum number of candies has bb candies. Then Santa will be satisfied, if the both conditions are met at the same time:

• b−a≤1b−a≤1 (it means b=ab=a or b=a+1b=a+1);
• the number of kids who has a+1a+1 candies (note that a+1a+1 not necessarily equals bb) does not exceed ⌊k2⌋⌊k2⌋ (less than or equal to ⌊k2⌋⌊k2⌋).

⌊k2⌋⌊k2⌋ is kk divided by 22 and rounded down to the nearest integer. For example, if k=5k=5 then ⌊k2⌋=⌊52⌋=2⌊k2⌋=⌊52⌋=2.

Your task is to find the maximum number of candies Santa can give to kids so that he will be satisfied.

You have to answer tt independent test cases.

Input

The first line of the input contains one integer tt (1≤t≤5⋅1041≤t≤5⋅104) — the number of test cases.

The next tt lines describe test cases. The ii-th test case contains two integers nn and kk (1≤n,k≤1091≤n,k≤109) — the number of candies and the number of kids.

Output

For each test case print the answer on it — the maximum number of candies Santa can give to kids so that he will be satisfied.

Example

input

Copy

5
5 2
19 4
12 7
6 2
100000 50010

output

Copy

5
18
10
6
75015

Note

In the first test case, Santa can give 33 and 22 candies to kids. There a=2,b=3,a+1=3a=2,b=3,a+1=3.

In the second test case, Santa can give 5,5,45,5,4 and 44 candies. There a=4,b=5,a+1=5a=4,b=5,a+1=5. The answer cannot be greater because then the number of kids with 55 candies will be 33.

In the third test case, Santa can distribute candies in the following way: [1,2,2,1,1,2,1][1,2,2,1,1,2,1]. There a=1,b=2,a+1=2a=1,b=2,a+1=2. He cannot distribute two remaining candies in a way to be satisfied.

In the fourth test case, Santa can distribute candies in the following way: [3,3][3,3]. There a=3,b=3,a+1=4a=3,b=3,a+1=4. Santa distributed all 66 candies.

解题说明：此题是一道模拟题，先使每个人糖果一样且尽可能用最多糖，然后再一个一个分派知道糖不够或者达到[k/2]

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include<iostream>
#include<algorithm>
#include <bits/stdc++.h>
using namespace std;

int main()
{
	int t, n, k, m, l, p;
	scanf("%d", &t);
	for (int i = 0; i < t; i++)
	{
		scanf("%d %d", &n, &k);
		m = n % k;
		p = k / 2;
		if (m > p)
		{
			l = n - m + p;
		}
		else
		{
			l = n;
		}
		printf("%d\n", l);
	}
	return 0;
}