#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned ll
#define nl "\n"
#define sz(x) int(x.size())
#define NumOfDigit(w) log10(w) + 1
#define fill(arr, val)  memset(arr, val , sizeof(arr))
#define PI 3.141592654
#define ceil(w, m) (((w) / (m)) + ((w) % (m) ? 1 : 0))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define fi first
#define se second
#define cin(v) for (auto&i:v) cin >> i;
#define cout(v) for (auto&i:v) cout << i << " ";
#define fixed(n) fixed << setprecision(n)
//#define MOD  1e9 + 7


void IO(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
}
void files(){
    //freopen("filename.in" , "r" ,stdin);
            #ifndef ONLINE_JUDGE
              freopen("input.txt", "r", stdin);  freopen("output.txt", "w", stdout);
            #endif
}
bool prime(ll n){
    if(n==2 || n==3) return true;
    if(n<2 || n%2==0  ) return false;
    for(int i=3;i<=sqrt(n);i+=2)   if(n%i==0) return false;
    return true;
}



void solve(){

ll x,y;
cin >> x >> y;
int tm=0;
if( y % x !=0) tm++ , y-= y % x ;

if( x==y ) return void(cout << tm << nl);

ll mul = y/x ;
if( mul % 2 ==0){
    cout << mul/2 + tm << nl;
}
else
    cout << mul/2 + 1  << nl;

}

int main(){
                 IO();       //  files();

    int testCase=1;  // one test case
    cin >> testCase ;
 while(testCase--)
        solve();  // my code

    return 0;
}