#include <bits/stdc++.h>
using namespace std;
int mpow(int base, int exp);
void ipgraph(int m);
void dfs(int u, int par);
const int mod = 1000000007;
const int N = 1e6, M = N;
const int LN = 1e9;
long long dir[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
struct cmp {
  bool operator()(const pair<int, int> &a, const pair<int, int> &b) {
    int len1 = a.second - a.first + 1;
    int len2 = b.second - b.first + 1;
    if (len1 == len2) {
      return a.first < b.first;
    }
    return len1 > len2;
  }
};
long long fac[N], inv[N], b[N];
int mpow(int base, int exp) {
  base %= mod;
  int result = 1;
  while (exp > 0) {
    if (exp & 1) result = ((long long)result * base) % mod;
    base = ((long long)base * base) % mod;
    exp >>= 1;
  }
  return result;
}
void pre() {
  int i;
  fac[0] = inv[0] = 1;
  fac[1] = inv[1] = 1;
  for (i = 2; 2 < N ? i < N : i > N; 2 < N ? i += 1 : i -= 1) {
    fac[i] = (i * fac[i - 1]) % mod;
    inv[i] = (mpow(i, mod - 2) * inv[i - 1]) % mod;
  }
}
long long C(int n, int r) {
  if (r > n) return 0;
  long long ans = fac[n];
  ans *= inv[r];
  ans %= mod;
  ans *= inv[n - r];
  ans %= mod;
  return ans;
}
long long n;
vector<vector<int>> arr(50, vector<int>(50));
vector<int> permutation;
int chosen[100] = {0};
long long power(long long a, long long b) {
  long long ans = 1;
  while (b--) ans *= a;
  return ans;
}
long long k;
long long dp[N][2];
vector<int> adj[N];
long long m;
void solve() {
  long long a, b, c, p = 0, q, d, r, s, l, t, x, h, y, z, avg, x1, x2, y1, y2,
                     i, j, ii, jj, count = 0;
  string s1, s2 = "", sa = "", sb = "", sc = "", ans = "";
  cin >> a >> b >> c;
  if (a >= c) {
    cout << -1 << ' ';
  } else {
    cout << 1 << ' ';
  }
  if (c < a * b) {
    cout << b << endl;
  } else
    cout << -1 << endl;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t;
  t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
}
