Problem:
Score : 400 points

Problem Statement

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.

Sample Input 1

20 4
3 7 8 4

Sample Output 1

777773

The integer 777773 can be formed with 3 + 3 + 3 + 3 + 3 + 5 = 20 matchsticks, and this is the largest integer that can be formed by 20 matchsticks under the conditions.

Sample Input 2

101 9
9 8 7 6 5 4 3 2 1

Sample Output 2

71111111111111111111111111111111111111111111111111

The output may not fit into a 64-bit integer type.

Sample Input 3

15 3
5 4 6

Sample Output 3

654

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Runtime Error)

import java.util.*;

public class Main {
	
	public static class Matches {
		HashMap<Integer, Integer> matchCost;
		
		public Matches() {
			matchCost = new HashMap<Integer, Integer>();
			matchCost.put(1, 2);
			matchCost.put(2, 5);
			matchCost.put(3, 5);
			matchCost.put(4, 4);
			matchCost.put(5, 5);
			matchCost.put(6, 6);
			matchCost.put(7, 3);
			matchCost.put(8, 7);
			matchCost.put(9, 6);
		}
		
		public int getCost(int digit) {
			return matchCost.get(digit);
		}
		
		public int getLargestSingleDigit(int numMatches, int[] digits) {
			int max = 0;
			for (int i = 0; i < digits.length; i++) {
				if (matchCost.get(digits[i]) <= numMatches) {
					if (digits[i] > max) {
						max = digits[i];
					}
				}
			}
			return max;
		}
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int N = sc.nextInt();
		int M = sc.nextInt();

		int[] digits = new int[M];
		int maxRepetitions = 0;
		int maxDigit = 0;
		Matches matches = new Matches();
		
		String[] possibleSums = new String[N+1];
		possibleSums[N] = "";
		
		for (int i = 0; i < M; i++) {
			digits[i] = sc.nextInt();
		}
		
		Arrays.sort(digits);
		
		for (int i = 0; i < M; i++) {
			possibleSums[matches.getCost(digits[i])] = Integer.toString(digits[i]);
		}
		
		for (int i = 1; i <= N; i++) {
			if (possibleSums[i] != null) {
				for (int j = 0; j < M; j++) {
					if (i + matches.getCost(digits[j]) <= N && (possibleSums[i + matches.getCost(digits[j])] == null || possibleSums[i + matches.getCost(digits[j])].length() < possibleSums[i].length()+1 || 
					(possibleSums[i + matches.getCost(digits[j])].length() == possibleSums[i].length()+1 && Integer.valueOf(possibleSums[i + matches.getCost(digits[j])].charAt(possibleSums[i + matches.getCost(digits[j])].length()-1)) < digits[j]))) {
						possibleSums[i + matches.getCost(digits[j])] = possibleSums[i]+digits[j];
					}
				}
			}
		}
		
		char[] solution = possibleSums[N].toCharArray();;
		Arrays.sort(solution);
		for (int i = 0; i < solution.length/2; i++) {
			char temp = solution[i];
			solution[i] = solution[solution.length-1-i];
			solution[solution.length-1-i] = temp;
		}
		System.out.println(String.valueOf(solution));
	}
}