#include<stdio.h> #include<math.h> #include <queue> #include<algorithm> #include <iostream> #include <string.h> using namespace std; int gcd(int a,int b) { return a%b?gcd(b,a%b):b; } int main() { int t; scanf("%d",&t); while(t--) { int a,b; scanf("%d%d",&a,&b); int ans; for(int i=2*b;;i+=b) { if(gcd(a,i)==b) { ans=i; break; } } printf("%d\n",ans); } return 0; }