/* #region Head */

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());

#define endl '\n'
#define sqrt sqrtl
#define floor floorl
#define log2 log2l

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T, typename U> ostream &operator<<(ostream &os, um<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
// #define DEBUG_

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

string yes = "Yes", no = "No";
// string yes = "YES", no = "NO";
void yn(bool p) { cout << (p ? yes : no) << endl; }

/* #endregion */

// Problem
void solve() {
    ll _n, m;
    cin >> _n >> m;
    vll a(m);
    cin >> a;
    sort(ALL(a));

    vll req{0, 2, 5, 5, 4, 5, 6, 3, 7, 6}; // 桁の数字→使用本数
    vll reqs;                              // 使用本数のリスト
    REP(i, 0, m) reqs.push_back(req[a[i]]);
    sort(ALL(reqs));
    UNIQ(reqs);
    vll digit2use(10, 0); // ある桁の本数→使う数字，のマップ
    REP(i, 0, m) chmax(digit2use[req[a[i]]], a[i]);
    dump(digit2use);

    vll weight_(m);
    REP(i, 0, m) weight_[i] = req[a[i]];

    // 下位桁は使用本数の少ないマッチを使って桁数を稼ぐのが最善なので，枝刈りできそうにも見えるが...
    // 上位桁は大きな数字が作れたほうがお得だが，マッチを余分に使うかも知れない

    ll cap = _n;          // ナップサックの容量
    ll n = m;             // 品物の種類
    vll weight = weight_; // 品物ごとの重量=マッチしよう本数
    vll value(m, 1);      // 品物ごとの価値=桁数=1
    // dump(weight, value);

    // dp[i+1][w] := i 番目までの商品を用いて総重量を w にするときの，(総価値の最大値, その数字を使う回数)
    vc<vc<pll>> dp(n + 1, vc<pll>(cap + 1, make_pair(-1, -1)));
    // 初期条件 dp[0%2][w] = 0; for all w
    dp[0][0] = make_pair(0, 0);
    REP(i, 0, n)    // 品物の種類 i ごと
    REPM(w, 0, cap) // i 番目までの商品を用いたときの総重量 w ごと
    {
        if (w < weight[i])
            dp[(i + 1)][w] = make_pair(dp[i][w].first, 0LL);
        else if (dp[(i + 1)][w - weight[i]].first == -1)
            dp[(i + 1)][w] = make_pair(dp[i][w].first, 0LL);
        else if (dp[i][w].first == -1)
            dp[(i + 1)][w] =
                make_pair(dp[(i + 1)][w - weight[i]].first + value[i], dp[(i + 1)][w - weight[i]].second + 1);
        else {
            if (dp[i][w].first == dp[(i + 1)][w - weight[i]].first + value[i])
                dp[(i + 1)][w] =
                    make_pair(dp[(i + 1)][w - weight[i]].first + value[i], dp[(i + 1)][w - weight[i]].second + 1);
            else
                dp[(i + 1)][w] =
                    max(make_pair(dp[i][w].first, 0LL),
                        make_pair(dp[(i + 1)][w - weight[i]].first + value[i], dp[(i + 1)][w - weight[i]].second + 1));
        }
    }
    // ll max_sum_value = 0;
    // ll sum_weight = 0;
    // REPM(w, 0, cap) {
    //     if (chmax(max_sum_value, dp[n % 2][w])) {
    //         sum_weight = w;
    //     }
    // }
    dump(dp);
    assert(dp[n][cap].first != -1);
    ll cur = cap;
    vc<pll> cond;
    REPR(i, n, 1) {
        if (dp[i][cur].second > 0) {
            // dump(dp[i][cur]);
            cond.emplace_back(digit2use[weight[i - 1]], dp[i][cur].second);
            cur -= weight[i - 1] * dp[i][cur].second;
        }
    }
    // dump(cond);
    sort(ALL(cond));
    reverse(ALL(cond));
    REP(k, 0, SIZE(cond)) {
        // auto [digit, cnt] = cond[k];
        ll digit = cond[k].first, cnt = cond[k].second;
        REP(l, 0, cnt) cout << digit;
    }
    cout << endl;
}

// entry point
int main() {
    solve();
    return 0;
}


Measured memory_bytes: 2048