Peter\'s Number

Problem Statement

\n Peter\\\'s Number \n \n \n Imagine that Peter likes numbers a lot and wants to choose a number that consists of n digits. But it has to be special. Peter also wants it to have a sum of digits equal to s, which should be as large as possible. The number cannot have leading zeroes. Can you help Peter find that number or determine that it does not exist? \n \n \n \n Input Format \n The first line of input contains an integer n, representing the number of digits in the requested number. \n The second line of input contains s, representing the sum of its digits. \n \n \n \n Output Format \n Print the requested number if it exists or -1 otherwise. \n \n \n \n Constraints \n \n 1 ≤ n ≤ 10 5 \n 0 ≤ s ≤ 10 6 \n \n \n \n \n Examples \n \n \n Example #1 \n Input:\n1\n5 \n Output:\n5 \n \n Explanation: 5 is the only one digit number with the sum of digits equal to five. \n \n \n\n \n Example #2 \n Input:\n2\n15 \n Output:\n96 \n \n Explanation: Notice that the person could, for example, choose