#include <cmath> #include <deque> #include <algorithm> #include <iterator> #include <list> #include <tuple> #include <map> #include <unordered_map> #include <queue> #include <set> #include <unordered_set> #include <stack> #include <string> #include <vector> #include <fstream> #include <iostream> #include <functional> #include <numeric> #include <iomanip> #include <stdio.h> #include <assert.h> #include <cstring> //eolibraries #define lnf 3999999999999999999 #define inf 999999999 #define fi first #define se second #define pb push_back #define ll long long #define ld long double #define all(c) (c).begin(),(c).end() #define sz(c) (int)(c).size() #define make_unique(a) sort(all(a)),a.erase(unique(all(a)),a.end()); #define rep(i,n) for(int i=0;i<n;i++) #define drep(i,n) for(int i=n-1;i>=0;i--) #define crep(i,x,n) for(int i=x;i<n;i++) #define vec(...) vector<__VA_ARGS__> #define _3kynfAJ ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0) //eodefine using namespace std; using pii=pair<int,int>; using vi=vec(int); const int mxn=12000; int main(){ _3kynfAJ; int t; cin>>t; rep(cs,t){ int a,b; cin>>a>>b; int x=a,ans=0; rep(i,b-1){ a+=x; ans++; } while(a>=0){ a--; ans++; } cout<<ans<<"\n"; } // return 0; }