#include<bits/stdc++.h>
    using namespace std;
    #define endl '\n'
    #define ll long long int
    #define vv vector<long long>
    #define dq deque<long long>
    #define mpp map<long long,long long>
    #define ms multiset<long long>
    #define ss set<long long>
    #define vpp vector<pair<long long, long long>>
    #define MOD 1000000007
    #define YES cout<<"YES"<<endl
    #define NO cout<<"NO"<<endl
    #define all(a) a.begin(),a.end()
    #define sort_rev(a) sort(a.rbegin(),a.rend())
    #define all_n for(int i=0;i<n;i++)
    #define print(a) for(auto it:a)cout<<it<<" "
    #define print_pair(a) for(auto it:a)cout<<it.first<<" "<<it.second<<endl
    #define scan(a,n) for(int i=0;i<n;i++)cin>>a[i]
    void requisite(){
        ios::sync_with_stdio(false);
        cin.tie(nullptr);cout.tie(nullptr);
    }
    void solve(){
        ll l,r,x;cin>>l>>r>>x;
        ll d=x<0?-x:x;
        ll val= abs(l-r);
        if (val< d){
            cout<<-1 <<" "<<-1<<endl;
            return;
        }
        if (x<0){
            ll a= min(l,r);
            ll b=a+x;
            cout<<a<< " "<<b<<endl;
        }
        else{
            ll a=max(l,r);
            ll b=a-x;
            cout<<a<<" "<<b<<endl;
        }
    }
    int main() {
        requisite();
        ll t=1;
        cin>>t;
        while (t--){
            solve();
        }
        return 0;
    }