Fraction Construction Problem
时间限制:C/C++/Rust/Pascal 1秒,其他语言2秒
空间限制:C/C++/Rust/Pascal 256 M,其他语言512 M
Special Judge, 64bit IO Format: %lld

题目描述

There are t queries.

In each query, you are given two positive integers a and b ().

Please print a line consists of four positive integers c,d,e,f satisfying the following constraints:

    • 
    • d < b and f < b
    • 

If there are multiple solutions, you can print anyone.

If there are no solution, please print "-1 -1 -1 -1" in this line.

输入描述:

The first line contains one integer t () --- the number of test cases.

The only line of each test case contains two integers a and b ().

输出描述:

For each test case print four integers --- c,d,e,f. If there are no solution, c,d,e,f should all be -1.
示例1

输入

复制
3
4 1
1 6
37 111

输出

复制
-1 -1 -1 -1
1 2 1 3
145 87 104 78