import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;

enum inf3 = 1_001_001_001;
enum inf6 = 1_001_001_001_001_001_001L;
enum mod = 1_000_000_007L;


void main() {
    int n, m;
    scan(n, m);
    auto a = readln.split.to!(int[]);

    a.sort!"a > b"();

    auto c = [0, 2, 5, 5, 4, 5, 6, 3, 7, 6];

    auto dp = new string[](n + 1);
    dp[] = null;
    dp[0] = "";

    foreach (i ; 1 .. n + 1) {
        foreach (ai ; a) {
            if (i - c[ai] < 0 || !dp[i - c[ai]]) continue;
            auto s = ('0' + ai).to!char ~ dp[i - c[ai]];
            if (dp[i].length < s.length || dp[i] < s) {
                dp[i] = s;
            }
        }
    }

    debug {
        writeln(dp);
    }

    writeln(dp[n]);
}








void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}

void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}
