#include <cstdio>
#include <iostream>
#include <algorithm>
#include <queue>
#include <cmath>
#include <cstring>
#include <string>
#include <stack>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define endl "\n"
#define S second
#define F first
#define ln cout<<endl;
#define mem(a) memset((a),0,sizeof (a));
#define yes cout<<"YES"<<endl;
#define no cout<<"NO"<<endl;
#define debug cout<<"here!"<<endl;

ll cnt,n,m,t,ans,ant;
const int N=2e5+10;
const int INF=0x3f3f3f3f;
string str;

void solve()
{
    cin>>n>>m;
    if(n==m)
    {
        cout<<m<<' '<<m<<endl;
        return;
    }
    if(m==0)
    {
        cout<<"0 0"<<endl;
        return;
    }

    cout<<m<<' '<<n/(n-m+1)<<endl;
    // cout<<n<<' '<<n-m<<endl;
    return;
}

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