#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<functional>
#include<string>
#include<cstring>
#include<cstdlib>
#include<queue>
#include<utility>
#include<fstream>
#include<sstream>
#include<cmath>
#include<cstdio>
#include <ctime>
#include<cassert>

using namespace std;

#define MEM(a,b) memset(a,(b),sizeof(a))
#define MAX(a,b) ((a) > (b) ? (a) : (b))
#define MIN(a,b) ((a) < (b) ? (a) : (b))

#define maxn 1000000
#define maxt 100

typedef long long  LL;



int main()
{
   int i,j,k,T,n,m,cs=0;

   scanf("%d",&T);
   assert(T>=1 && T<=maxn);

   while(T--)
   {
      int a,b;
      scanf("%d%d",&a,&b);
      assert(a>=0 && a<=maxn && b>=0 && b<=maxn);
      printf("%d %d\n",MAX(a,b),a+b);
   }

	return 0;
}