#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define FOR(i,k,n) for(int(i)=(k);(i)<(n);++(i))
#define rep(i,n) FOR(i,0,n)
#define all(v) begin(v),end(v)
#define debug(x) std::cerr<<#x<<": "<<x<<"\n"
#define debug2(x,y) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<"\n"
#define debug3(x,y,z) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<", "<<#z<<": "<<z<<"\n"

typedef long long ll;
typedef std::vector<int> vi;
typedef std::vector<vi> vvi;
typedef std::vector<ll> vll;
typedef std::vector<vll> vvll;
template<typename T> using vvec=std::vector<std::vector<T>>;
template<typename T>
auto make_v(size_t sz){return std::vector<T>(sz);}
template<typename T,typename... Ts>
auto make_v(size_t sz,Ts...ts){return std::vector<decltype(make_v<T>(ts...))>(sz,make_v<T>(ts...));}
template<typename T>
void fill_v(T&var,const T&x){var=x;}
template<typename V,typename T>
void fill_v(V&v,const T&x){for(auto&& w:v){fill_v(w,x);}}

template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<std::vector<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<std::deque<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s, const std::set<T>&v){
  s<<"\n";for(auto&& elm:v){s<<elm<<"\t";}s<<"\n";return s;}

inline void scan(int&a){scanf("%d",&a);}
inline void scan(ll&a){scanf("%lld",&a);}
inline void scan(char&a){scanf(" %c",&a);}
inline void scan(double&a){scanf("%lf",&a);}
template<typename T>
inline void scan(std::vector<T>&v){for(auto&& sv:v){scan(sv);}}
template<typename First,typename...Args>
inline void scan(First&f,Args&...args){scan(f);scan(args...);}
inline void scan(std::string&s){char BUF[3000000];scanf(" %s",BUF);s=std::string(BUF);}
inline void print(int a){printf("%d\n",a);}
inline void print(ll a){printf("%lld\n",a);}
inline void print(double a){printf("%.12f\n",a);}
inline void print(std::string s){std::cout<<s<<"\n";}

using namespace std;

void print_(vi & ans) {
  for (int i = 9; i > 0; --i) {
    assert(ans[i] >= 0);
    rep (j, ans[i]) {
      printf("%d", i);
    }
  }
  printf("\n");
  exit(0);
}

int main() {
  int n, m;
  scan(n, m);
  vi use = {99999, 2, 5, 5, 4, 5, 6, 3, 7, 6};
  map<int, int> canmake;
  rep (i, m) {
    int a;
    scan(a);
    canmake[use[a]] = max(canmake[use[a]], a);
  }
  vi cost(10, -1);
  for (auto&& p : canmake) {
    cost[p.first] = p.second;
  }
  debug(cost);
  vi ans(10, 0);
  if (cost[2] > 0) {
    int loopnum = n/2;
    if (n % 2 == 0) {
    } else if (cost[3] > 0) {
      ans[cost[3]] += 1;
      loopnum = (n-3)/2;
    } else if (cost[5] > 0) {
      ans[cost[5]] += 1;
      loopnum = (n-5)/2;
    } else if (cost[7] > 0) {
      ans[cost[7]] += 1;
      loopnum = (n-7)/2;
    } else {
      assert(false);
    }
    ans[cost[2]] = loopnum;
    print_(ans);
  }
  if (cost[3] > 0) {
    int loopnum = n/3;
    if (n % 3 == 2) {
      if (cost[5] > 0) {
        ans[cost[5]] += 1;
        loopnum = (n-5)/3;
      } else if (cost[4] > 0) {
        ans[cost[4]] += 2;
        loopnum = (n-8)/3;
      } else if (cost[7] > 0) {
        ans[cost[7]] += 2;
        loopnum = (n-14)/3;
      } else {
        assert(false);
      }
    } else if (n % 3 == 1) {
      if (cost[4] > 0) {
        ans[cost[4]] += 1;
        loopnum = (n-4)/3;
      } else if (cost[7] > 0) {
        ans[cost[7]] += 1;
        loopnum = (n-7)/3;
      } else if (cost[5] > 0) {
        ans[cost[5]] += 2;
        loopnum = (n-10)/3;
      } else {
        assert(false);
      }
    }
    ans[cost[3]] = loopnum;
    print_(ans);
  }
  if (cost[4] > 0) {
    int loopnum = n/4;
    if (n % 4 == 3) {
      if (cost[6] == 9 && cost[5] > 0) {
        ans[cost[6]] += 1;
        ans[cost[5]] += 1;
        loopnum = (n-11)/4;
      } else if (cost[7] > 0) {
        ans[cost[7]] += 1;
        loopnum = (n-7)/4;
      } else if (cost[6] > 0 && cost[5] > 0) {
        ans[cost[6]] += 1;
        ans[cost[5]] += 1;
        loopnum = (n-11)/4;
      } else if (cost[5] > 0) {
        ans[cost[5]] += 3;
        loopnum = (n-15)/4;
      } else {
        assert(false);
      }
    } else if (n % 4 == 2) {
      if (cost[6] > 0) {
        ans[cost[6]] += 1;
        loopnum = (n-6)/4;
      } else if (cost[5] > 0) {
        ans[cost[5]] += 2;
        loopnum = (n-10)/4;
      } else if (cost[7] > 0) {
        ans[cost[7]] += 2;
        loopnum = (n-14)/4;
      }
    } else if (n % 4 == 1) {
      if (cost[5] > 0) {
        ans[cost[5]] += 1;
        loopnum = (n-5)/4;
      } else if (cost[6] > 0 && cost[7] > 0) {
        ans[cost[6]] += 1;
        ans[cost[7]] += 1;
        loopnum = (n-13)/4;
      } else if (cost[7] > 0) {
        ans[cost[7]] += 3;
        loopnum = (n-21)/4;
      } else {
        assert(false);
      }
    }
    ans[cost[4]] = loopnum;
    print_(ans);
  }
  if (cost[5] > 0) {
    int loopnum = n/5;
    if (n % 5 == 4) {
      if (cost[6] == 9) {
        ans[cost[6]] += 4;
        loopnum = (n-24)/5;
      } else if (cost[7] > 0) {
        ans[cost[7]] += 2;
        loopnum = (n-14)/5;
      } else if (cost[6] > 0) {
        ans[cost[6]] += 4;
        loopnum = (n-24)/5;
      } else {
        assert(false);
      }
    } else if (n % 5 == 3) {
      if (cost[6] == 9) {
        ans[cost[6]] += 3;
        loopnum = (n-18)/5;
      } else if (cost[6] > 0 && cost[7] > 0) {
        ans[cost[6]] += 1;
        ans[cost[7]] += 1;
        loopnum = (n-13)/5;
      } else if (cost[6] > 0) {
        ans[cost[6]] += 3;
        loopnum = (n-18)/5;
      } else if (cost[7] > 0) {
        ans[cost[7]] += 4;
        loopnum = (n-28)/5;
      } else {
        assert(false);
      }
    } else if (n % 5 == 2) {
      if (cost[6] == 9) {
        ans[cost[6]] += 2;
        loopnum = (n-12)/5;
      } else if (cost[7] > 0) {
        ans[cost[7]] += 1;
        loopnum = (n-7)/5;
      } else if (cost[6] > 0) {
        ans[cost[6]] += 2;
        loopnum = (n-12)/5;
      } else {
        assert(false);
      }
    } else if (n % 5 == 1) {
      if (cost[6] > 0) {
        ans[cost[6]] += 1;
        loopnum = (n-6)/5;
      } else if (cost[7] > 0) {
        ans[cost[7]] += 3;
        loopnum = (n-21)/5;
      } else {
        assert(false);
      }
    }
    ans[cost[5]] = loopnum;
    print_(ans);
  }
  if (cost[6] > 0) {
    int loopnum = n/6;
    if (n % 6 != 0) {
      if (cost[7] > 0) {
        ans[cost[7]] += n % 6;
        loopnum = (n - (7 * (n % 6)))/6;
      } else {
        assert(false);
      }
    }
    ans[cost[6]] = loopnum;
    print_(ans);
  }
  if (cost[7] > 0) {
    int loopnum = n/7;
    assert(n % 7 == 0);
    ans[cost[7]] = loopnum;
    print_(ans);
  }

  return 0;
}


Measured memory_bytes: 888