using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using static System.Math;
using static System.Array;

namespace AtCoderSolve
{
    class Solve
    {

        const int mod = 1000000007;
        const int INF = int.MaxValue / 2;
        const long SINF = long.MaxValue / 2;


        static int N, M;
        static List<Pair<int>> A = new List<Pair<int>>();
        //static double[] p;
        
        //static long[] A, B;


        public static void Input()
        {
            var cin = new Scanner();
            var input = cin.SplitReader();
            N = input[0];
            M = input[1];
            var p = cin.SplitReader();
            foreach(var x in p)
            {
                if (x == 1)
                {
                    A.Add(new Pair<int>(x, 2));
                }
                if (x == 7)
                {
                    A.Add(new Pair<int>(x, 3));
                }
                if (x == 4)
                {
                    A.Add(new Pair<int>(x, 4));
                }
                if (x == 2 || x == 3 || x == 5)
                {
                    A.Add(new Pair<int>(x, 5));
                }
                if (x == 6 || x == 9)
                {
                    A.Add(new Pair<int>(x, 6));
                }
                if (x == 8)
                {
                    A.Add(new Pair<int>(x, 7));
                }
            }
            A.Sort((x, y) => y.CompareTo(x));
        }


        static void Main(string[] args)
        {
            Input();

            //var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
            //Console.SetOut(sw);

            long[] dp = new long[N + 1];
            for(var i = 0; i <= N; i++)
            {
                dp[i] = i == 0 ? 0 : -1 * SINF;
            }

            for(var i = 1; i <= N; i++)
            {
                foreach(var x in A)
                {
                    if (i - x.index < 0)
                    {
                        continue;
                    }
                    dp[i] = Max(dp[i - x.index] + 1, dp[i]);
                }
            }

            var ans = new StringBuilder();
            long res = N;
            for(var i = 0; i < dp[N]; i++)
            {
                foreach(var x in A)
                {
                    if (res - x.index >= 0 && dp[res] == dp[res - x.index] + 1) 
                    {
                        ans.Append($"{x.variable}");
                        res -= x.index;
                        break;
                    }
                }
            }

            Console.WriteLine(ans);



            //Console.Out.Flush();
        }
    }

    public class Scanner
    {
        public int[] SplitReader()
        {
            int[] array = Console.ReadLine().Split().Select(int.Parse).ToArray();
            return array;
        }
        public long[] SplitReaderL()
        {
            long[] array = Console.ReadLine().Split().Select(long.Parse).ToArray();
            return array;
        }
    }

    public class PriorityQueue<T> where T : IComparable<T>
    {
       
        private List<T> Q;
        private readonly int r;

        public PriorityQueue(bool ascending)
        {
            if (ascending)
            {
                r = 1;
            }
            else
            {
                r = -1;
            }
            Q = new List<T>();
        }

        private void PushHeap(List<T> list, T item)
        {
            int n = list.Count();
            list.Add(item);

            while (n != 0)
            {
                int pIndex = (n - 1) / 2;

                if (list[n].CompareTo(list[pIndex]) * r > 0)
                {
                    Swap(Q, n, pIndex);
                }
                else { break; }

                n = pIndex;
            }
        }

        private void PopHeap(List<T> list)
        {
            int n = list.Count() - 1;
            list[0] = list[n];
            list.RemoveAt(n);

            int cur = 0;
            int comp;

            while (2 * cur + 1 <= n - 1)
            {
                int c1 = 2 * cur + 1;
                int c2 = 2 * (cur + 1);
                if (c1 == n - 1)
                {
                    comp = c1;
                }
                else
                {

                    comp = list[c1].CompareTo(list[c2]) * r > 0 ? c1 : c2;
                }

                if (list[cur].CompareTo(list[comp]) * r < 0)
                {
                    Swap(Q, cur, comp);
                }
                else { break; }

                cur = comp;
            }
        }

        private void Swap(List<T> list, int a, int b)
        {
            T keep = list[a];
            list[a] = list[b];
            list[b] = keep;
        }


        public void Enqueue(T value)
        {
            PushHeap(Q, value);
        }

        public T Dequeue()
        {
            T ret = Q[0];
            PopHeap(Q);
            return ret;
        }

        public T Peek()
        {
            return Q[0];
        }

        public int CountItem()
        {
            return Q.Count();
        }
    }

    struct Pair<T> : IComparable<Pair<T>> where T : IComparable<T>
    {
        public T variable;
        public int index;

        public Pair(T val, int i)
        {
            variable = val;
            index = i;
        }

        public int CompareTo(Pair<T> otherPair)
        {
            return variable.CompareTo(otherPair.variable);
        }

        public int CompareIndex(Pair<T> otherPair)
        {
            return index.CompareTo(otherPair.index);
        }
    }


}






Measured memory_bytes: 13696