#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;

//#define int long long
//using ll = boost::multiprecision::cpp_int;
using ll = long long;
//constexpr int INF = 1e9;//INT_MAX=(1<<31)-1=2147483647
constexpr ll INF = (ll)1e18;//(1LL<<63)-1=9223372036854775807
constexpr ll MOD = (ll)1e9 + 7;
constexpr double EPS = 1e-9;
constexpr int dx[4]={1,0,-1,0};
constexpr int dy[4]={0,1,0,-1};
#ifdef LOCAL_ENV
	#define debug(var) std::cout<<#var" = "<<var<<std::endl
#else
	#define debug(var)
#endif
#define p(var) std::cout<<var<<std::endl
#define rep(i, n)   for(ll i=0, i##_length=(n); i< i##_length; ++i)
#define repeq(i, n) for(ll i=1, i##_length=(n); i<=i##_length; ++i)
#define all(a) (a).begin(), (a).end()
#define PI (acos(-1))
template<typename T> inline T power(T x, T n){ return n ? power(x*x%MOD,n/2)*(n%2?x:1)%MOD : 1; }
template<typename T> inline T gcd(T a, T b) { return b ? gcd(b,a%b) : a; }
template<typename T> inline T lcm(T a, T b) { return a / gcd(a,  b) * b; }
template<typename T1, typename T2>inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template<typename T1, typename T2>inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
template<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& p) {return s << "(" << p.first << ", " << p.second << ")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
	for (int i = 0, len = v.size(); i < len; ++i){
		s << v[i]; if (i < len - 1) s << "\t";
	}
	return s;
}
template<typename T> ostream& operator<<(ostream& s, const vector< vector<T> >& vv) {
	for (int i = 0, len = vv.size(); i < len; ++i){
		s << vv[i] << endl;
	}
	return s;
}
template<typename T1, typename T2> ostream& operator<<(ostream& s, const map<T1, T2>& m) {
	s << "{" << endl;
	for (typeof(m.begin()) itr = m.begin(); itr != m.end(); ++itr){
		s << "\t" << (*itr).first << " : " << (*itr).second << endl;
	}
	s << "}" << endl;
	return s;
}

/*-----8<-----8<-----*/

class Item{
public:
	ll value;
	ll weight;
	Item():value(0),weight(0){}
	Item(ll value,ll weight):value(value),weight(weight){}
	bool operator<(const Item &another) const
	{
		return ((double)value/weight) < ((double)another.value/another.weight);
	};
};

constexpr ll N_MAX = 10000;
constexpr ll M_MAX = 9;
constexpr ll A_I_MAX = 9;

ll N, W;
vector<ll> a;

void input() {
	scanf("%lld%lld", &W, &N);
	a.assign(N,0);
	rep(i, N) scanf("%lld", &a[i]);
}

void solve() {
	int match[]={0,2,5,5,4,5,6,3,7,6};
	sort(all(a));
	vector<Item> items(N);
	rep(i,N){
		items[i].value=a[i]*a[i]*a[i]+10000000;
		items[i].weight=match[a[i]];
	}

	vector<vector<ll>> dp(N+1, vector<ll>(W+1,0));
	rep(n,N){
		rep(w,W+1){
			if(w < items[n].weight || (w!=items[n].weight && dp[n+1][w-items[n].weight]==0)){
				dp[n+1][w]=dp[n][w];
			}else{
				//商品の個数制限なし
				dp[n+1][w]=max(dp[n][w], dp[n+1][w-items[n].weight]+items[n].value);
			}
		}
	}
	debug(dp);
	vector<ll> packed(N,0);
	ll w = W;
	for(ll n=N-1;n>=0;n--){
		while(items[n].weight <= w && (w == items[n].weight || dp[n+1][w-items[n].weight] > 0) && dp[n][w] < dp[n+1][w-items[n].weight]+items[n].value ){
			packed[n]++; 
			w -= items[n].weight;
		}
	}
	debug(packed);
	vector<ll> ans;
	rep(i,N)rep(j,packed[i])ans.push_back(a[i]);
	sort(all(ans),greater<ll>());
	rep(i,ans.size())printf("%lld",ans[i]);
	puts("");

}

signed main() {
	input();
	solve();
	return 0;
}


Measured memory_bytes: 1152