60分求调(必关)

#include <iostream>
using namespace std;

void solve() {
    int x, y;
    cin >> x >> y;
    bool isFarmerTurn = true;
    
    while (true) {
        if (isFarmerTurn) {
            if (x < y) {
                x += 1;
            } else {
                x = x / 2;
            }
            if (x == 0) break;
        } else {
            if (y < x) {
                y += 1;
            } else {
                y = y / 2;
            }
            if (y == 0) break;
        }
        isFarmerTurn = !isFarmerTurn;
    }
    
    cout << x << " " << y << endl;
}

int main()
{
    int T;
    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}