11388 - GCD LCM

/*
+---------------------------------------------+
|                                             |
|       © 29/08/2023 (16:22) MinaMagdy        |
|                                             |
+---------------------------------------------+
*/
#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 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>
#define endl "\n"
#define MOD 1000000007
#define INF 2000000000
#define all(s) s.begin(), s.end()
#define rall(s) s.rbegin(), s.rend()
#define sz(x) int(x.size())

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

ll lcm(ll a, ll b) {
    return a / __gcd(a, b) * b;
}

void solve() {
    ll a, b;
    cin >> a >> b;
    ll g = __gcd(a, b);
    ll l = lcm(a, b);
    if (a == g && b == l) {
        cout << a << " " << b << endl;
    }
    else {
        cout << -1 << endl;
    }
}

int main(void)
{
    ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
    int testcase = 1;
    cin >> testcase;
    while (testcase--)
        solve();
    return 0;
}