Bob has n matches. He wants to compose numbers using the following scheme (that is, digit 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 needs 6, 2, 5, 5, 4, 5, 6, 3, 7, 6 matches): Fig 1 Digits from matches Write a program to make a non-negative integer which is a multiple of m. The integer should be as big as possible. Input The input consists of several test cases. Each case is described by two positive integers n (n ≤ 100) and m (m ≤ 3000), as described above. The last test case is followed by a single zero, which should not be processed. Output For each test case, print the case number and the biggest number that can be made. If there is no solution, output ‘-1’. Note that Bob don’t have to use all his matches. Sample Input 63 56 0 Sample Output Case 1: 111 Case 2: -1