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

T RD(T = string)() { static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T)(in string str) { return str.split.to!(T[]); }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool INSIDE(T)(T x, T b, T e) { return x >= b && x < e; }

long mod = pow(10, 9) + 7;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

struct UnionFind
{
	void init(long n) { par = new long[](n); foreach (i; 0..n) par[i] = i; }
	long root(long i) { return par[i] == i ? i : (par[i] = root(par[i])); }
	bool same(long i, long j) { return root(i) == root(j); }
	void unite(long i, long j) { i = root(i); j = root(j); if (i == j) return; par[i] = j; }
	long[] par;
}

void main()
{
	auto N = RD!long;
	auto M = RD!long;
	auto A = RDR.split.to!(long[]);
	auto cnt = [2, 5, 5, 4, 5, 6, 3, 7, 6];
	long[2][] use;
	foreach (e; A)
	{
		use ~= [cnt[e-1], e];
	}
	
	auto dp = new long[][](N+10);
	foreach (i; 0..N)
	{
		if (i != 0 && dp[i].length == 0) continue;
		foreach (e; use)
		{
			auto di = i + e[0];
			auto tmp = dp[i].dup ~ e[1];
			tmp.sort!"a > b"();
			if (tmp.length > dp[di].length)
			{
				dp[di] = tmp;
			}
			else if (tmp.length == dp[di].length)
			{
				bool isBig = false;
				foreach (j; 0..tmp.length)
				{
					if (tmp[j] > dp[di][j])
					{
						isBig = true;
						break;
					}
				}
				if (isBig) dp[di] = tmp;
			}
			//stderr.writeln(i, ":", e[0], " ", di, " ", dp[di]);
		}
	}

	foreach (e; dp[N])
	{
		write(e);
	}

	writeln();
	stdout.flush();
}