{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eThe \u003cstrong\u003e GCD\u003c/strong\u003e of two positive integers is the largest integer that divides both the integers without any remainder. The \u003cstrong\u003eLCM\u003c/strong\u003e of two positive integers is the smallest positive integer that is divisible by both the integers. A positive integer can be the \u003cstrong\u003eGCD\u003c/strong\u003e of many pairs of numbers. Similarly, it can be the \u003cstrong\u003eLCM\u003c/strong\u003e of many pairs of numbers. In this problem, you will be given two positive integers. You have to output a pair of numbers whose \u003cstrong\u003eGCD\u003c/strong\u003e is the first number and \u003cstrong\u003eLCM\u003c/strong\u003e is the second number.\u003c/p\u003e\n\n\u003cp\u003e\u003ch2\u003eInput\u003c/h2\u003e\u003c/p\u003e\n\n\u003cp\u003eThe first line contains the number of tests \u003cstrong\u003eT \u003c/strong\u003e(\u003cstrong\u003eT ≤ 100\u003c/strong\u003e). Each of the next \u003cstrong\u003eT\u003c/strong\u003e lines contains two positive integer \u003cstrong\u003eG\u003c/strong\u003e and \u003cstrong\u003eL. \u003c/strong\u003eBoth \u003cstrong\u003eG \u003c/strong\u003eand \u003cstrong\u003eL \u003c/strong\u003eare less than \u003cstrong\u003e2^31\u003c/strong\u003e.\u003c/p\u003e\n\n\u003cp\u003e\u003ch2\u003eOutput\u003c/h2\u003e\u003c/p\u003e\n\n\u003cp\u003eFor each test case print in a separate line two positive integers \u003cstrong\u003ea\u003c/strong\u003e and \u003cstrong\u003eb\u003c/strong\u003e (\u003cstrong\u003ea ≤ b\u003c/strong\u003e), which \u003cstrong\u003eGCD\u003c/strong\u003e is \u003cstrong\u003eG\u003c/strong\u003e and \u003cstrong\u003eLCM\u003c/strong\u003e is \u003cstrong\u003eL. \u003c/strong\u003eIf the answer is not unique, output the pair for which \u003cstrong\u003ea\u003c/strong\u003e is minimal. If there is no such pair, print \u003cstrong\u003e-1\u003c/strong\u003e.\u003c/p\u003e\n\n"}},{"title":"Example","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e2\n1 2\n3 4\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e1 2\n-1\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}