#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define ll long long
typedef pair<ll,ll> pii;

const int mod=998244353;
inline int add(int x,int y){int ret=x+y;if(ret>=mod)ret-=mod;return ret;}
inline int sub(int x,int y){int ret=x-y;if(ret<0)ret+=mod;return ret;}
inline int mul(int x,int y){return ((ll)x*y)%mod;}
inline int step(int base,int pw){int ret=1;while(pw){if(pw&1)ret=mul(ret,base);base=mul(base,base);pw>>=1;}return ret;}
inline int invv(int x){return step(x,mod-2);}

const int maxn=3e5+10;


int main() {


    ///freopen("test.txt","r",stdin);

    int t;
    scanf("%d",&t);
    while(t--){

        int n,m;
        scanf("%d %d",&n,&m);

        printf("%d ",m);

        int l=1;
        int r=m;
        int ret=0;
        int sr;
        while(l<=r){
            sr=(l+r)/2;
            //printf("%d %d AAA\n",l,r);
            if(m/sr-(m%sr==0)<=n-m){
                r=sr-1;
                ret=sr;
            }
            else l=sr+1;
        }

        printf("%d\n",ret);

    }


    return 0;
}