#include <bits/stdc++.h>

#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT_ON(bit, i) (((bit >> i) & 1) > 0)

typedef long long LL;
template<typename T> std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts> auto make_v(size_t a, Ts... ts){ return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}    // C++14
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
template<class T> inline void print(T x) { std::cout << x << std::endl; }
template<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) {  if (i != 0) {std::cout << " ";} std::cout << v[i];} std::cout << "\n"; }
template<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }
template<typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }
template<class T> inline std::vector<T> unique(std::vector<T> v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    return v;
}
// 初項s, 交差dのn個の数列の和
long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
    return n * (2 * s + (n - 1) * d) / 2;
}

const int INF = 1 << 30;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy4 = {0, -1, 0, 1}, dx4 = {1, 0, -1, 0};
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };


using namespace std;


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N, M;
    cin >> N >> M;

    auto A = make_v<int>(10);
    FOR(i, 0, M) {
        int a;
        cin >> a;
        A[a] = 1;
    }

    map<int, int> m;
    auto v = make_v<pair<int, int>>(0);
    if (A[1]) { v.emplace_back(make_pair(1, 2)); m[2] = 1;}
    if (A[7]) { v.emplace_back(make_pair(7, 3)); m[3] = 7;}
    if (A[4]) { v.emplace_back(make_pair(4, 4)); m[4] = 4;}
    if (A[5]) { v.emplace_back(make_pair(5, 5)); m[5] = 5; }
    else if (A[3]) { v.emplace_back(make_pair(3, 5)); m[5] = 3;}
    else if (A[2]) { v.emplace_back(make_pair(2, 5)); m[5] = 2;}
    if (A[9]) {v.emplace_back(make_pair(9, 6)); m[6] = 9;}
    else if (A[6]) {v.emplace_back(make_pair(6, 6)); m[6] = 6;}
    if (A[8]) {v.emplace_back(make_pair(8, 7)); m[7] = 8;}
    sort(ALL(v));

    auto dp = make_v<vector<int>>(10100);
    auto dp_t = make_v<LL>(10100);
    FOE(p, v) {
        auto x = p.second;
        if (dp[x].size() == 0) {
            dp[x] = vector<int>{m[x]};
            dp_t[x] = m[x];
        }
        FOR(i, 0, 10000) {
            if (dp[i].size() != 0) {
                auto t = dp[i];
                t.emplace_back(m[x]);
                auto tt = dp_t[i] + m[x];

                if (t.size() >= dp[i + x].size()) {
                    dp[i + x] = t;
                    dp_t[i + x] = tt;
                }
            }
        }
    }

    sort(RALL(dp[N]));
    FOE(x, dp[N]) {
        cout << x;
    }
    cout << endl;

    return 0;
}

Measured memory_bytes: 107776