Largest number possible
Submissions: 6110   Accuracy:

26.83%

  Difficulty: Easy   Marks: 2
       

Given two numbers 'N' and 'S' , find the largest number that can be formed with 'N' digits and whose sum of digits should be equals to 'S'.
 

Input

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains two space separated integers N and S, where N is the number of digits and S is the sum.
 

Output

Print the largest number that is possible.
If their is no such number, then print -1 

 

Constraints:

1 <= T <= 30
1 <= N <= 50
0 <= S <= 500

 

Example 

Input
2
2 9
3 20

Output 

90
992 


Expected Time Complexity: O(n)
 

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

Author: Rohan Malhotra


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

to report an issue on this page.