For this Question: A boy lost the password of his super locker. He remembers the number of digits N as well as the sum S of all the digits of his password. He know that his password is the largest number of N digits that can be possible with given sum S. As he is busy doing his homework, help him retrieving his password.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 in password and S is the sum of all the digits of the password.

Constraints:
1 <= T <= 100
1 <= N <= 10^4
0 <= S <= 10^6Corresponding to each test case, in a new line, print the largest integer if possible , else print -1.
The number should not have any leading zeroes

Note: Since the numbers can be very large, you have to print the answer in String formatInput:
3
5 12
3 29
3 26

Output:
93000
-1
998

Explanation :
Testcase 1: Sum of elements is 12. Largest possible 5 digit number is 93000.
Testcase 2: There is no such three digit number whose sum is 29., I have written this Solution Code: #include "bits/stdc++.h"
#pragma GCC optimize "03"
using namespace std;
 
#define int long long int
#define ld long double
#define pi pair<int, int>
#define pb push_back
#define fi first
#define se second
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#ifndef LOCAL
#define endl '\n'
#endif
 
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9 + 9;

signed main() {
	IOS;
	int t;	cin >> t;
	while(t--){
		int n, s;	cin >> n >> s;
		if(n*9 < s){
			cout << -1 << endl;
			continue;
		}
		string t = "";
		for(int i = 1; i <= n; i++){
			if(s >= 9)
				t += '9', s -= 9;
			else
				t += (char)('0'+s), s = 0;
		}
		cout << t << endl;
	}	
	return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?