#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() {
    int n, m;
    cin >> n >> m;
    cout << m << ' ';
    if (!m) {
        cout << m << '\n';
        return;
    }
    if (n-m >= m-1) {
        cout << 1 << '\n';
    } else {
        int l = n-m;
        cout << m - m/(l+1)*l << '\n';
        // cout << m - m/(n-m+1)*(n-m+1) << '\n';
    }
}

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