Given ```N``` coins and an int array ```costs``` of representing the cost of each digit (1...9), where ```costs[i]``` is the cost of picking ```i```. Find the largest number that can be represented by using the ```N``` coins.\n\n**Examples**\n```\nInput: N = 5, costs = [12, 3, 5, 1, 2, 6, 8, 9, 1]\nOutput: 99999\nExplanation: 9 costs 1 coin to use, hence with 5 coins we can pick 9, 5 times.\n\nInput: N = 2, costs = [11, 13, 2, 2, 3, 5, 4, 8, 6, 10, 7]\nOutput: 4\nExplanation: 4 costs 2 coin to use, hence with 2 coins we can pick 4, 1 time.\n\nInput: N = 5, costs = [9, 9, 9, 9, 9, 9, 9, 9, 9]\nOutput: -1\nExplanation: No number can be formed from 5 coins, hence print -1;\n```\n\n**Constraints**\nsizeof(costs) = 9\n1 <= T <= 10^3\n1 <= N <= 10^3\n1 <= costs[i] <= 10^3

Given N coins and an int array costs of representing the cost of each digit (1...9), where costs[i] is the cost of picking i. Find the largest number that can b