Match Matching

Find the largest integer that can be formed with exactly N matchsticks, under the following conditions:

• Every digit in the integer must be one of the digits A_1, A_2, ..., A_M (1 \leq A_i \leq 9).
• The number of matchsticks used to form digits 1, 2, 3, 4, 5, 6, 7, 8, 9 should be 2, 5, 5, 4, 5, 6, 3, 7, 6, respectively.

Constraints

• All values in input are integers.
• 2 \leq N \leq 10^4
• 1 \leq M \leq 9
• 1 \leq A_i \leq 9
• A_i are all different.
• There exists an integer that can be formed by exactly N matchsticks under the conditions.

Input

Input is given from Standard Input in the following format:

N M A_1 A_2 ... A_M

Output

Print the largest integer that can be formed with exactly N matchsticks under the conditions in the problem statement.

Examples

Input

20 4 3 7 8 4

Output

777773

Input

101 9 9 8 7 6 5 4 3 2 1

Output

71111111111111111111111111111111111111111111111111

Input

15 3 5 4 6

Output

654

inputFormat

input are integers.

• 2 \leq N \leq 10^4
• 1 \leq M \leq 9
• 1 \leq A_i \leq 9
• A_i are all different.
• There exists an integer that can be formed by exactly N matchsticks under the conditions.

Input

Input is given from Standard Input in the following format:

N M A_1 A_2 ... A_M

outputFormat

Output

Print the largest integer that can be formed with exactly N matchsticks under the conditions in the problem statement.

Examples

Input

20 4 3 7 8 4

Output

777773

Input

101 9 9 8 7 6 5 4 3 2 1

Output

71111111111111111111111111111111111111111111111111

Input

15 3 5 4 6

Output

654

样例

101 9
9 8 7 6 5 4 3 2 1

71111111111111111111111111111111111111111111111111