#include <bits/stdc++.h>
using namespace std;
long long int mod1 = pow(10, 9) + 7;
int mod2 = 998244353;
long long int inf = 1e9;
long long int maxxy = 1e5 + 9;
const double PI = 3.141592653589793238;
long long int power(long long int x, long long int y, long long int pp) {
  long long int res = 1;
  x = x % pp;
  while (y > 0) {
    if (y & 1) res = (res * x) % pp;
    y = y >> 1;
    x = (x * x) % pp;
  }
  return res;
}
long long int modInverse(long long int n, long long int pp) {
  return power(n, pp - 2, pp);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int t;
  cin >> t;
  while (t--) {
    long long int a, b, c;
    cin >> a >> b >> c;
    if (a >= c) {
      cout << "-1"
           << " ";
    } else {
      cout << "1"
           << " ";
    }
    if (a * b > c) {
      cout << b << " ";
    } else {
      cout << "-1"
           << " ";
    }
    cout << "\n";
  }
  return 0;
}
