import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        TaskD solver = new TaskD();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskD {
        public void solve(int testNumber, InputReader in, OutputWriter out) {
            int N = in.readInt();
            int M = in.readInt();
            int[] A = in.readIntArray(M);
            Arrays.sort(A);
            int[] numOfMatch = {2, 5, 5, 4, 5, 6, 3, 7, 6};

            int[] dp = new int[N + 1];
            String ans = "";
            dp[0] = 0;
            int numOfAj;
            //dpによって桁数を求める
            for (int i = 1; i < N + 1; i++) {
                //Ajの全探索
                for (int j = M - 1; j >= 0; j--) {
                    numOfAj = numOfMatch[A[j] - 1];
                    if (i < numOfAj) {
                        if (j == 0 && dp[i] == 0) {
                            dp[i] = -1;
                            break;
                        }
                        continue;
                    }
                    if (dp[i - numOfAj] == -1 && dp[i] == 0) {
                        if (j == 0) {
                            dp[i] = -1;
                            break;
                        }
                        continue;
                    }
                    if (dp[i - numOfAj] >= dp[i]) {
                        dp[i] = dp[i - numOfAj] + 1;
                    }
                }
            }

            //dp[N]桁のansを求める
            int digit = dp[N];
            for (int i = 0; i < digit; i++) {
                for (int j = M - 1; j >= 0; j--) {
                    numOfAj = numOfMatch[A[j] - 1];
                    if (N >= numOfAj && dp[N - numOfAj] == dp[N] - 1) {
                        ans += A[j];
                        N -= numOfAj;
                        break;
                    }
                }
            }
            out.printLine(ans);
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int[] readIntArray(int size) {
            int[] array = new int[size];
            for (int i = 0; i < size; i++) {
                array[i] = readInt();
            }
            return array;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int readInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void print(Object... objects) {
            for (int i = 0; i < objects.length; i++) {
                if (i != 0) {
                    writer.print(' ');
                }
                writer.print(objects[i]);
            }
        }

        public void printLine(Object... objects) {
            print(objects);
            writer.println();
        }

        public void close() {
            writer.close();
        }

    }
}



Measured memory_bytes: 58580