#1112. Divisible Numbers

Divisible Numbers

Cannot parse: (0 , import_utils.normalizeSubtasks) is not a function or its return value is not iterable

Background

Special for beginners, ^_^

Description

You are given 4 positive integers a, b, c, d with a<c and b<d. Find any pair of numbers x and y that satisfies the following conditions:

  • a<xc, b<yd,
  • xy is divisible by ab.

Note that required x and y may not exist.

Format

Input

The first line of the input contains a single integer t (1≤t≤10), the number of test cases.

The descriptions of the test cases follow.

The only line of each test case contains four integers a, b, c and d (1a<c109, 1≤b<d≤109).

Output

For each test case print a pair of numbers a<xc and b<yd such that xy is divisible by ab. If there are multiple answers, print the anyone of them. If there is no such pair of numbers, then print -1 -1.

Samples

10
1 1 2 2
3 4 5 7
8 9 15 18
12 21 14 24
36 60 48 66
1024 729 373248 730
1024 729 373247 730
5040 40320 40319 1000000000
999999999 999999999 1000000000 1000000000
268435456 268435456 1000000000 1000000000
2 2
4 6
12 12
-1 -1
-1 -1
373248 730
-1 -1
15120 53760
-1 -1
536870912 536870912

Limitation

1s, 1024KiB for each test case.