Associated Course(s):
Must Do Interview Preparation

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)

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.

Sulagna | 117 |

RUTVIKHARIPARA | 116 |

janvidavda105190 | 93 |

harshsiddhapura105461 | 93 |

devsinghindra | 80 |

PiyushPandey4 | 614 |

ASWATHAMA | 561 |

akhyasharma01 | 547 |

john_wick | 521 |

jagrit_07 | 443 |

blackshadows | 5362 |

Ibrahim Nash | 5242 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4598 |

Login to report an issue on this page.