/*   /\_/\
 *   (= ._.) Authored by Likith...
 *   / >  \> Next level : "Expert"
 */

#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;

typedef long long ll;
// const ll mod = 998244353;
const ll MOD = 1e9 + 7;
#define gcd __gcd
#define int long long
#define lcm(a, b) (a * b / gcd(a, b))
#define ceil(x, y) (x + y - 1ll) / y
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
#define MOD(x) x = ((x % mod) + mod) % mod
#define hib(x) (31 - (int)(__builtin_clz(x)))
const long double pi = 3.14159265358979323846;
// template <typename T> using o_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// o_set<int>se;
// se.insert(1);
// se.insert(2);
// cout << *se.find_by_order(0) << endl; ///k th element
// cout << se.order_of_key(2) << endl; ///number of elements less than k

// https://nor-blog.codeberg.page/posts/2021-10-26-gcc-optimization-pragmas/
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#pragma GCC targrt("avx,sse,sse2")
#pragma GCC target("avx2,popcnt")

ll power(ll curr, ll zero, ll p = MOD)
{
    ll res = 1;
    curr = curr % p;
    while (zero > 0)
    {
        if (zero & 1)
            res = (res * curr) % p;
        zero = zero >> 1;
        curr = (curr * curr) % p;
    }
    return res;
}

void Likith_Solve(int TC)
{
    // cout << setprecision(10) << fixed;
    // cout << "Case #" << TC << ": "<<idx<<" "<<mini;
    // cout<<endl;
    int l,r,x;
    cin>>l>>r>>x;
    if(x>0){
        if(l+x>r)cout<<"-1 -1\n";
        else cout<<l<<" "<<l+x<<endl;
    }else{
        if(r+x<l)cout<<"-1 -1\n";
        else cout<<r<<" "<<r+x<<endl;
    }
}
// 1001 0110
int32_t main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    int t = 1;
    cin >> t;
    for (int i = 1; i <= t; i++)
        Likith_Solve(i);
    return 0;
}

// https://cses.fi/book/book.pdf