题解 | #小红的取模构造#

#include <iostream>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <numeric>
#include <ctime>
#include <string>
#include <bitset>
#include <unordered_map>
#include <unordered_set>

using namespace std;
using ll = long long;

const ll N = 1e5 + 5, mod = 1e9 + 7, inf = 2e18;

ll a, b;

void solve() {
    cin >> a >> b;

    if (a == b && b == 0) {
        cout << "1 1\n";
        return ;
    }

    if (a == 0) {
        cout << b + b << " " << b << "\n";
        return ;
    }
    if (b == 0) {
        cout << a << " " << a + a << '\n';
        return ;
    }

    if (a > b) {
        b += a;
        cout << a << " " << b << '\n';
    } else if (a < b) {
        a += b;
        cout << a << " " << b << '\n';
    } else {
        cout << "-1 -1\n";
    }

}

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int t = 1;
    cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}