for i in range(int(input())):
n,k=map(int,input().split())
for i in range(k):
j=2
if n%2==0:
n=n+2*(k-i)
break
else:
while n%j!=0:
j+=1
if n%(j+1)==0:
j+=1
n+=j
print(n)#include <bits/stdc++.h>
using namespace std;
#define int int long long
#define vi vector< int>
#define mi map< int, int>
#define vii vector< int, int>
#define el << endl
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int sol(int n){
if(n%2==0) return 2;
for (int i = 3; i <= sqrt(n); i++) if(n%i==0) return i;
return n;
}
int ch()
{
int n,k,res = 0, maxi = 0, mini = 0;
string s;
cin >> n >> k;
int a = sol(n);
cout << n + a + (k-1)*2 << endl;
return 0;
}
int32_t main()
{
std::cout << std::fixed << std::setprecision(0);
fast
int t; cin >> t;
while (t--) ch();
return 0;
}2149. Rearrange Array Elements by Sign | 2150. Find All Lonely Numbers in the Array |
2151. Maximum Good People Based on Statements | 2144. Minimum Cost of Buying Candies With Discount |
Non empty subsets | 1630A - And Matching |
1630B - Range and Partition | 1630C - Paint the Middle |
1630D - Flipping Range | 1328A - Divisibility Problem |
339A - Helpful Maths | 4A - Watermelon |
476A - Dreamoon and Stairs | 1409A - Yet Another Two Integers Problem |
977A - Wrong Subtraction | 263A - Beautiful Matrix |
180C - Letter | 151A - Soft Drinking |
1352A - Sum of Round Numbers | 281A - Word Capitalization |
1646A - Square Counting | 266A - Stones on the Table |
61A - Ultra-Fast Mathematician | 148A - Insomnia cure |
1650A - Deletions of Two Adjacent Letters | 1512A - Spy Detected |
282A - Bit++ | 69A - Young Physicist |
1651A - Playoff | 734A - Anton and Danik |