#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define ull unsigned long long
#define nl '\n'
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define rall(s)  s.rbegin(), s.rend()
#define getline(s) getline(cin>>ws,s)
#define ceill(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
#define pi  3.141592653589793
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define multi_ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>


void Fast_IO(){
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
// freopen("filename.in", "r", stdin);
// freopen("filename.txt", "w", stdout);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}

int x[8] = { 2, 1, -1, -2, -2, -1, 1, 2 };
int y[8] = { 1, 2, 2, 1, -1, -2, -2, -1 };




void solve(){
ll n,m; cin>>n>>m;
for(int i=0; i<n; i++)
    for(int j=0; j<m; j++){
        int cnt =0;
        for(int k=0; k<8; k++){
            int nx = i+x[k];
            int ny = j+y[k];
            if(nx>=0 && nx<n && ny>=0 && ny<m){
            cnt++;
            }
        }
        if(cnt ==0){
            cout<<i+1<<' '<<j+1<<nl;
            return;
        }
    }
cout<<n<<' '<<m<<nl;




}

int main(){
    Fast_IO();
int t =1;
cin>>t;
while(t--){
solve();
}
return 0;
}