CF 1373A Donut Shops

Description

There are two rival donut shops.

The first shop sells donuts at retail: each donut costs a

dollars.

The second shop sells donuts only in bulk: box of b
donuts costs c dollars. So if you want to buy x donuts from this shop, then you have to buy the smallest number of boxes such that the total number of donuts in them is greater or equal to x.

You want to determine two positive integer values:

  1. how many donuts can you buy so that they are strictly cheaper in the first shop than in the second shop?

  2.how many donuts can you buy so that they are strictly cheaper in the second shop than in the first shop?

If any of these values doesn't exist then that value should be equal to −1.If there are multiple possible answers, then print any of them.

The printed values should be less or equal to 1e9.It can be shown that under the given constraints such values always exist if any values exist at all.

Input

The first line contains a single integer t (1≤t≤1000) — the number of testcases.

Each of the next t
lines contains three integers a, b and c (1≤a≤1e9, 2≤b≤1e9, 1≤c≤1e9).

Output

For each testcase print two positive integers. For both shops print such x that buying x donuts in this shop is strictly cheaper than buying x donuts in the other shop. x should be greater than 0 and less or equal to 1e9.

If there is no such x, then print −1. If there are multiple answers, then print any of them.

Example

input

4
5 10 4
4 5 20
2 2 3
1000000000 1000000000 1000000000

output

-1 20
8 -1
1 2
-1 1000000000

Note

In the first testcase buying any number of donuts will be cheaper in the second shop. For example, for 3 or 5 donuts you'll have to buy a box of 10 donuts for 4 dollars. 3 or 5 donuts in the first shop would cost you 15 or 25 dollars, respectively, however. For 20 donuts you'll have to buy two boxes for 8 dollars total. Note that 3 and 5 are also valid answers for the second shop, along with many other answers.

In the second testcase buying any number of donuts will be either cheaper in the first shop or the same price. 8 donuts cost 32 dollars in the first shop and 40 dollars in the second shop (because you have to buy two boxes). 10 donuts will cost 40 dollars in both shops, so 10 is not a valid answer for any of the shops.

In the third testcase 1 donut costs 2 and 3 dollars, respectively. 2 donuts cost 4 and 3 dollars. Thus, 1 is a valid answer for the first shop and 2 is a valid answer for the second shop.

In the fourth testcase 1e9 donuts cost 1e18 dollars in the first shop and 1e9 dollars in the second shop.

Solution

  思路：

  先计算一个的价格。如果一个的平均价格第一个店小于第二个店，那么第一个店总会小于第二个店，直接输出"1 -1"即可。如果买一个的平均价格第二个店小于第一个店则需要再次分类讨论，先判断买一个的价格即a和c的大小，如果c小则输出"-1 b"即可(读者可以以买一个为例)，反之输出"1 b"即可。

#include<iostream>
#include<algorithm>
#include<string>
#define ll long long
using namespace std;

int main(){
    ll t;
    cin>>t;

    while(t--){
        double a,b,c;
        cin>>a>>b>>c;
        if(a<=c/b){
            cout<<"1 -1"<<endl;
        }
        else{
            if(a>=c){
                printf("-1 %lld\n",(ll)b);
            }
            else{
                printf("1 %lld\n",(ll)b);
            }
        }
    }

    return 0;
}