// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define NUM1 1000000007LL
#define all(a) a.begin(), a.end()
#define beg(a) a.begin(), a.begin()
#define sq(a) ((a)*(a))
#define NUM2 998244353LL
#define MOD NUM1
#define fi first
#define se second
typedef long double ld;
const ll MAX = 73;
const ll INF = LLONG_MAX/10;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ld eps = 1e-9;

void solve()
{
    ll n, m;
    cin >> n >> m;
    cout << m << ' ' << (n/(n - m + 1)) << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
	ll t = 1;
	cin >> t;
	while(t--) solve();
    return 0;
}