#include <bits/stdc++.h>
#define endl '\n'
#define pll pair<ll, ll>
#define tll tuple<ll, ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define x first
#define y second
#define rep(i, j, k) for(int i = (j); i <= (k); i++)
#define per(i, j ,k) for(int i = (j); i >= (k); i--)
#define ios ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
using namespace std;
typedef long long ll;
const ll maxn = 2e5 + 10;
const ll mod = 998244353;
const ll inf = 0x3f3f3f3f;

void solve(){
	int n, m;
	cin >> n >> m;
	cout << m << " ";
	for (int i = 0; i <= n; ++i){
		int tmp = n % (i + 1);
		int cnt = n / (i + 1);
		int mxsum = cnt * i + tmp;
		if (mxsum >= m) {
			cout << i << endl;
			break;
		}
	}
}

int main(){
    ios;
    //freopen("sample.txt", "r", stdin);
    //freopen("resout.txt", "w", stdout);
    int t = 1;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}