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 C# (Mono 4.6.2.0) (judge verdict: Runtime Error)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace AtCoder.ABC118
{
    class D
    {
        public static void Solve()
        {
            var s = Console.ReadLine().Split(' ');
            var a = Console.ReadLine().Split(' ')
                .Select(x => int.Parse(x)-1)
                .OrderByDescending(x => x)
                .ToArray();
            int n = int.Parse(s[0]);
            int m = int.Parse(s[1]);
            int[] dp = Enumerable.Repeat(0,n+1).ToArray();
            int[] cost = { 2, 5, 5, 4, 5, 6, 3, 7, 6 };

            for (int i = 0; i < m; i++)
            {
                dp[n - cost[a[i]]] = 1;
            }

            for(int i = n; 1 < i; i--)
            {
                if (dp[i] <= 0)
                    continue;

                for(int j = 0; j < m; j++)
                {
                    var nc = i - cost[a[j]];
                    if (nc < 0)
                        continue;
                    dp[nc] = dp[i] + 1;
                }
            }
            //Console.WriteLine(dp[0]);

            var c = 0;
            while (c < n)
            {
                for(int i = 0; i < m; i++)
                {
                    int nc = c + cost[a[i]];
                    if (nc <= n && dp[c] == dp[nc]+1)
                    {
                        if (dp[c] == 1 && nc != n)
                            continue;

                        Console.Write(a[i] + 1);
                        c = nc;
                        break;
                    }
                }
            }
            Console.Write('\n');
        }
    }
}
namespace AtCoder
{
    class Program
    {
        static void Main(string[] args)
        {
            ABC118.D.Solve();
        }
    }
}