#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

typedef long long ll;

const ll mod=1e9+7;

const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};

#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define rc(x)  return cout<<x<<"\n",0
#define sz(s)  (int) s.size()
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define PI 3.14159265358979

using namespace std;

ll t,n;

void solve() {
	ll n,k;
	cin >> n >> k;
	if (n<=k) {
		cout << (k/n+(k%n!=0)) << '\n'; 
	}
	else {
		ll maxi = (n/k+(n%k!=0))*k;
		cout << (maxi/n+(maxi%n	!=0)) << '\n';
	}
}

int main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	t=1;
	cin >> t;
	while (t--) {
		solve();
	}

}
