#P1744E1. Divisible Numbers (easy version)

    ID: 682 Type: RemoteJudge 4000ms 256MiB Tried: 0 Accepted: 0 Difficulty: 5 Uploaded By: Tags>brute forcemathnumber theory*1500

Divisible Numbers (easy version)

Description

This is an easy version of the problem. The only difference between an easy and a hard version is the constraints on aa, bb, cc and dd.

You are given 44 positive integers aa, bb, cc, dd with a<ca < c and b<db < d. Find any pair of numbers xx and yy that satisfies the following conditions:

  • a<xca < x \leq c, b<ydb < y \leq d,
  • xyx \cdot y is divisible by aba \cdot b.

Note that required xx and yy may not exist.

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

The descriptions of the test cases follow.

The only line of each test case contains four integers aa, bb, cc and dd (1a<c1051 \leq a < c \leq 10^5, 1b<d1051 \leq b < d \leq 10^5).

For each test case print a pair of numbers a<xca < x \leq c and b<ydb < y \leq d such that xyx \cdot y is divisible by aba \cdot b. If there are multiple answers, print any of them. If there is no such pair of numbers, then print -1 -1.

Input

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

The descriptions of the test cases follow.

The only line of each test case contains four integers aa, bb, cc and dd (1a<c1051 \leq a < c \leq 10^5, 1b<d1051 \leq b < d \leq 10^5).

Output

For each test case print a pair of numbers a<xca < x \leq c and b<ydb < y \leq d such that xyx \cdot y is divisible by aba \cdot b. If there are multiple answers, print any of them. If there is no such pair of numbers, then print -1 -1.

Sample Input 1

5
1 1 2 2
3 4 5 7
8 9 15 18
12 21 14 24
36 60 48 66

Sample Output 1

2 2
4 6
12 12
-1 -1
-1 -1