#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
#define Pool(i, m, n) for (ll i = n; i >= m; i--)
#define mod 1000000007ll
//#define mod 998244353ll
#define flagcount __builtin_popcount
#define flag(x) (1ll << x)
#define flagadd(bit, x) bit |= flag(x)
#define flagpop(bit, x) bit &= ~flag(x)
#define flagon(bit, i) bit &flag(i)
#define flagoff(bit, i) !(bit & (1ll << i))
#define all(v) v.begin(), v.end()
#define low2way(v, x) lower_bound(all(v), x)
#define high2way(v, x) upper_bound(all(v), x)
#define idx_lower(v, x) (distance(v.begin(), low2way(v, x)))  //配列vでx未満の要素数を返す
#define idx_upper(v, x) (distance(v.begin(), high2way(v, x))) //配列vでx以下の要素数を返す
#define idx_lower2(v, x) (v.size() - idx_lower(v, x))         //配列vでx以上の要素数を返す
#define idx_upper2(v, x) (v.size() - idx_upper(v, x))         //配列vでxより大きい要素の数を返す
#define putout(a) cout << a << endl
#define Sum(v) accumulate(all(v), 0ll)
#define gcd(x, y) __gcd(x, y)
ll ctoi(char c)
{
    if (c >= '0' && c <= '9')
    {
        return c - '0';
    }
    return -1;
}
template <typename T>
string make_string(T N)
{
    string ret;
    T now = N;
    while (now > 0)
    {
        T x = now % 10;
        ret += (char)('0' + x);
        now /= 10;
    }
    reverse(all(ret));
    return ret;
}
template <typename T>
T lcm(T x, T y)
{
    T z = gcd(x, y);
    return x * y / z;
}
template <typename T>
bool primejudge(T n)
{
    if (n < 2)
        return false;
    else if (n == 2)
        return true;
    else if (n % 2 == 0)
        return false;
    double sqrtn = sqrt(n);
    for (T i = 3; i < sqrtn + 1; i++)
    {
        if (n % i == 0)
        {
            return false;
        }
        i++;
    }
    return true;
}

template <typename T>
bool chmin(T &a, const T &b)
{
    if (a > b)
    {
        a = b; // aをbで更新
        return true;
    }
    return false;
}
//場合によって使い分ける
//const ll dx[4]={1,0,-1,0};
//const ll dy[4]={0,1,0,-1};
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
//2次元配列の宣言
//vector<vector<ll>> field(h, vector<ll>(w));
const string minf = "-";
void chmax(string &s, string t)
{
    if (s == minf)
    {
        s = t;
        return;
    }
    if (s.size() < t.size())
    {
        s = t;
        return;
    }
    if (s.size() == t.size() && s < t)
    {
        s = t;
        return;
    }
    return;
}
//cost[i]:iを作るのに必要なコスト
const ll cost[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int main()
{
    cout << fixed << setprecision(30);
    ll N, M;
    cin >> N >> M;
    vector<ll> A(M);
    loop(i, M) cin >> A[i];
    vector<string> dp(11000, "-"); 
    dp[0] = "";
    loop(i, 10010)
    {
        if (dp[i] == minf)
            continue;
        loop(j, M)
        {
            ll nownum = cost[A[j]];
            chmax(dp[i + nownum], dp[i] + (char)('0' + A[j]));
        }
    }
    putout(dp[N]);
    return 0;
}

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

const int x[10] = {-1,2,5,5,4,5,6,3,7,6};
void chmax(int &a, const int &b) { if (a < b) a = b; return; }

int main(){
    int n, m; cin >> n >> m;

    vector<int> data(m);
    for (int i = 0; i < m; i++) cin >> data[i];
    sort(data.begin(),data.end(),greater<int>());

    vector<int> keta(n+1,-1); keta[0] = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < m; j++) {
            if (i - x[data[j]] >= 0) chmax(keta[i], keta[i - x[data[j]]] + 1);
        }
    }

    while (n > 0) {
        for (int i = 0; i < m; i++) {
            if (n - x[data[i]] >= 0 && keta[n] == keta[n - x[data[i]]] + 1) {
                cout << data[i];
                n -= x[data[i]];
                break;
            }
        }
    }
    return 0;
}