#include<bits/stdc++.h>
#define RI int
#define err puts("asd")
#define ll long long
#define ull unsigned long long 
#define LL __int128
#define mk make_pair
#define db double
#define FL fflush(stdout)
#define eb emplace_back
#define FR(u,v) for(int i=h[u],v=a[i].t;i;i=a[i].n,v=a[i].t)
#define mem(a,b) memset(a,b,sizeof a)
#define yes puts("Yes")
#define no puts("No")
#define gg puts("-1")
#define vc vector
#define ex exit(0)
#define fi first
#define se second
#define int long long
//#pragma GCC optimize(2)
//#pragma GCC optimize(3)
using namespace std;

const int inf=2e9+5;
const ll INF=1e18;
int mod=1e9+7;

inline ll power(ll x,int y){
	ll t=1;
	while(y){
		if(y&1) t=t*x%mod;
		x=x*x%mod;y>>=1;
	}
	return t;
}

inline void gt(int &x,int &y){if(x>y) swap(x,y);}

inline void cmax(int &x,int y){x<y?x=y:0;}

inline void cmin(int &x,int y){x>y?x=y:0;}

inline void AD(int &x,int y){x+=y-mod;x+=x>>31&mod;}

inline ll read(){
	ll s=0;char c=getchar();bool f=0;
	while(c<'0'||c>'9'){if(c=='-') f=1;c=getchar();}	
	while(c>='0'&&c<='9') s=(s<<1)+(s<<3)+c-48,c=getchar();
	return f?-s:s;
}

const int N=3e5+5;

int n,m,k;

inline void solve(){
	n=read();m=read();
	cout<<m<<' '<<ceil(1.0*m/(n-m+1))<<endl;
}

signed main(){
	RI x,y,z,u,v;
	//freopen("1.in","r",stdin);
	RI T=read();
	while(T--) solve();
	return 0;
}