t = int(input())
for _ in range(t):
n,m = map(int,input().split())
if n == 1 or m == 1:
print(n,m)
elif n > 3 or m > 3:
print(n,m)
else:
print(n-1,m-1)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define endl "\n"
#define intt __int128_t
#define all(a) a.begin(), a.end()
#define pb(a) push_back(a)
#define x first
#define y second
#define heap priority_queue
int main() {
fast_cin();
int t;
cin >> t;
while(t--){
int n, m;
cin >> n >> m;
if (n == 3 && m == 3){
cout << "2 2" << endl;
} else if ((n == 3 && m < 3)){
cout << "2 1" << endl;
} else if ((n < 3 && m == 3)) {
cout << "1 2" << endl;
}
else {
cout << "1 1"<< endl;
}
}
return 0;
}
122A - Lucky Division | 1611C - Polycarp Recovers the Permutation |
432A - Choosing Teams | 758A - Holiday Of Equality |
1650C - Weight of the System of Nested Segments | 1097A - Gennady and a Card Game |
248A - Cupboards | 1641A - Great Sequence |
1537A - Arithmetic Array | 1370A - Maximum GCD |
149A - Business trip | 34A - Reconnaissance 2 |
59A - Word | 462B - Appleman and Card Game |
1560C - Infinity Table | 1605C - Dominant Character |
1399A - Remove Smallest | 208A - Dubstep |
1581A - CQXYM Count Permutations | 337A - Puzzles |
495A - Digital Counter | 796A - Buying A House |
67A - Partial Teacher | 116A - Tram |
1472B - Fair Division | 1281C - Cut and Paste |
141A - Amusing Joke | 112A - Petya and Strings |
677A - Vanya and Fence | 1621A - Stable Arrangement of Rooks |