import core.bitop;
import std.algorithm;
import std.ascii;
import std.bigint;
import std.conv;
import std.functional;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.random;
import std.typecons;

alias sread = () => readln.chomp();
alias Point2 = Tuple!(long, "y", long, "x");

T lread(T = long)()
{
    return readln.chomp.to!T();
}

T[] aryread(T = long)()
{
    return readln.split.to!(T[])();
}

void scan(TList...)(ref TList Args)
{
    auto line = readln.split();
    foreach (i, T; TList)
    {
        T val = line[i].to!(T);
        Args[i] = val;
    }
}

void minAssign(T, U = T)(ref T dst, U src)
{
    dst = cast(T) min(dst, src);
}

void maxAssign(T, U = T)(ref T dst, U src)
{
    dst = cast(T) max(dst, src);
}

long[9] cost = [2, 5, 5, 4, 5, 6, 3, 7, 6];
bool[9] canuse;
void main()
{
    long N, M;
    scan(N, M);
    auto A = aryread();
    foreach (a; A)
        canuse[a - 1] = true;
    foreach (i; 0 .. 9)
        foreach (j; 0 .. i)
            if (canuse[i] && cost[i] == cost[j])
                canuse[j] = false;

    auto dp = new long[](N + 6);
    dp[] = long.min;
    dp[0] = 0;
    foreach (i; 0 .. N)
        foreach (j; 0 .. 9)
            if (canuse[j])
            {
                dp[i + cost[j]].maxAssign(dp[i] + 1);
            }

    string s;
    long tmp = N;
    loop: foreach (_; 0 .. dp[N])
        foreach_reverse (j; 0 .. 9)
            if (canuse[j] && cost[j] <= tmp && dp[tmp - cost[j]] + 1 == dp[tmp])
            {
                tmp -= cost[j];
                s ~= '1' + j;
                continue loop;
            }
    writeln(s);
}
