#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

void solve() {
    ll n, m;
    cin >> n >> m;

    cout << m << ' ';
    if (n == m) {
        cout << n << '\n';
        return;
    }
    if (!m) {
        cout << m << '\n';
        return;
    }
    int l = n-m;
    int ans = m /(l+1);
    if (m%(l+1)) ans++;
    cout << ans << '\n';
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);
    int t;
    cin >> t;
    while (t--)
        solve();
    return 0;
}