Partition a number into two divisible parts
Submissions: 1187   Accuracy:

26.61%

  Difficulty: Medium   Marks: 4

Given a number (as string) and two integers a and b, divide the string in two non-empty parts such that the first part is divisible by a and second part is divisible by b. If string can not be divided into two non-empty parts, output "-1”, else print the two parts.

Input:

The first line of input contains a single integer T denoting the number of test cases. Then T test cases follow. Each test case consists of single line containing 3 space seperated number denoting the respective values of  n, a and b.
Output:

For each test case output a single line containing the two space seperated non-empty parts else print -1.
Constraints:

1<=T<=100

1<=N<=106

1<=a,b<=N
Example:

Input:

3
1200 4 3
123 12 3
125 12 5

Ouput:

12 00
12 3
12 5

** For More Input/Output Examples Use 'Expected Output' option **

Author: harshitsidhwa


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.