//#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<pair<int,int>, null_type,less<pair<int,int>>, rb_tree_tag,tree_order_statistics_node_update>
void Fast()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void File() {
#ifndef ONLINE_JUDGE
freopen("Input.txt", "r", stdin);
freopen("Output.txt", "w", stdout);
#endif
}
typedef long long ll;
void justify(int n,int x)
{
string s=to_string(n);
for(int i=0;i<x-s.size();i++)cout<<' ';
cout<<s;
}
void solve()
{
ll a,n,res;
cin>>n>>a;
if(n%a==a-1)
res=n;
else if(n%a)
{
res=n-n%a+1;
}
else
{
res=n-1;
}
cout<<res<<'\n';
}
int main()
{
File();
Fast();
int t=1;
cin>>t;
for (int i = 1; i <= t;i++ )
{
//cout<<"Case "<<i<<": ";
solve();
}
}
Copy