/*
 * @Date: 2023-04-26 00:30:57
 * @Description: 请填写简介
 */
#include <bits/stdc++.h>

using i64 = long long;

template<typename A, typename B> std::ostream& operator<<(std::ostream &os, const std::pair<A, B> &p) {
	return os << '(' << p.first << ", " << p.second << ')';
}
template<typename T_container, typename T = 
typename std::enable_if<!std::is_same<T_container, std::string>::value, typename T_container::value_type>::type> 
std::ostream& operator<<(std::ostream &os, const T_container &v) { 
	os << '{'; std::string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}';
}
void debug_out() { std::cerr << std::endl; }
template<typename Head, typename... Tail> void debug_out(Head H, Tail... T) { std::cerr << ' ' << H; debug_out(T...); }
#define debug(...) std::cerr << "(" << #__VA_ARGS__ << "):", debug_out(__VA_ARGS__)

void solve() {
	int n, m;
	std::cin >> n >> m;
	int mx = m;
	int mi = 0;
	// PNPN
	// 5 4
	// 1 4
	// PPNPP
	// PNP NP
	if(n == m) {
		std::cout << m << " " << m << "\n";
		return;
	}
	if(m == 0) {
		std::cout << 0 << " " << 0 << "\n";
		return;
	}
	for(int i = 1; i <= 1e6; i ++) {
		int cnt = ceil(1.0 * n / (i + 1));
		// cnt = 2
		int now = cnt * i;
		int sum1 = m - now, sum2 = n - m - cnt + 1; // 还剩下的 P 和 N
		//if(now <= m && sum1 >= 0 && sum2 >= 0) {
			int cn = sum1 / i;
			if(sum2 >= cn) {
				mi = i;
				break;
			}
		//}
		// if(sum1 < 0) {
		// 	mi = i;
		// 	break;
		// }
	}
	std::cout << mx << " " << mi << "\n";
}

int main() {
	std::cin.tie(nullptr)->sync_with_stdio(false);
	int _ = 1; std::cin >> _;
	while(_--) solve();
	return 0;
}