object Main {
  def main(args: Array[String]): Unit = {
    val s = new Main()
    s.solve()
    s.out.flush()
  }
}

class Main {
  import java.io._
  import java.util.StringTokenizer                                    

  import scala.collection.mutable
  import scala.util.Sorting
  import math.{abs, max, min}
  import mutable.{ArrayBuffer, ListBuffer}
  import scala.reflect.ClassTag

  val MOD = 1000000007
  val out = new PrintWriter(System.out)

  def solve(): Unit = {
    val N, M = ni()
    val A = na(M)
    val C = Array(0,
      2, 5, 5,
      4, 5, 6,
      3, 7, 6)

    val set = mutable.Set[Int](A: _*)

    // c2 は c4, c6 よりえらい
    if (set.contains(1)) {
      set -= 4
      set -= 6
      set -= 9
    }

    // c3 は c6 よりえらい
    if (set.contains(7)) {
      set -= 6
      set -= 9
    }

    // 同じコストなら数値が大きい方が偉い
    if (set.contains(5)) {
      set -= 2
      set -= 3
    }

    // 同じコストなら数値が大きい方が偉い
    if (set.contains(3)) {
      set -= 2
    }

    // 同じコストなら数値が大きい方が偉い
    if (set.contains(9)) {
      set -= 6
    }

    val t = set.toArray // 値
    val c = t.map(C) // コスト
    val t2c = Array.ofDim[Int](10)
    REP(c.length) { i =>
      t2c(t(i)) = c(i)
    }
//    debug(t)
//    debug(c)
//    debug(t2c)

    val len = t.length

    val NN = N / c.min
    // (桁, 使った本数) = 最後の桁の数値
    val dp = Array.fill[Int](NN + 1, N + 1)(-1)
    dp(0)(0) = 0
    REP(NN) { i =>
      REP(N + 1) { j =>
        REP(len) { k =>
          if (j - c(k) >= 0 && dp(i)(j - c(k)) >= 0)
          dp(i + 1)(j) = max(dp(i + 1)(j), t(k)) // 一番大きい数値にしたい
        }
      }
    }

//    REP(dp.length) { i =>
//      debug(dp(i))
//    }

    // todo 復元
    val ans = ArrayBuffer[Int]()
    var mxDigit = 0
    REP(NN, 1) { i =>
      if (dp(i)(N) != -1) mxDigit = i
    }
//    debug(mxDigit)

    var p = N
    REP_r(mxDigit, 1) { i =>
      ans += dp(i)(p)
      p -= t2c(dp(i)(p))
    }

    out.println(ans.mkString)
  }


  def debug(as: Array[Boolean]): Unit = {
    System.err.println(as.map(x => if(x) "1" else "0").mkString)
  }

  def debug(as: Array[Int]): Unit = {
    System.err.println(as.mkString(" "))
  }

  def debug(as: Array[Long]): Unit = {
    System.err.println(as.mkString(" "))
  }

  def debug(s: String): Unit = {
    System.err.println(s)
  }

  def debug(num: Long): Unit = {
    System.err.println(num)
  }

  class InputReader(val stream: InputStream) {
    private val reader = new BufferedReader(new InputStreamReader(stream), 32768)
    private var tokenizer: StringTokenizer = _

    def next(): String = {
      while (tokenizer == null || !tokenizer.hasMoreTokens)
        tokenizer = new StringTokenizer(reader.readLine)
      tokenizer.nextToken
    }

    def nextInt(): Int = next().toInt
    def nextLong(): Long = next().toLong
    def nextChar(): Char = next().charAt(0)
  }
  val sc = new InputReader(System.in)
  def ni(): Int = sc.nextInt()
  def nl(): Long = sc.nextLong()
  def nc(): Char = sc.nextChar()
  def ns(): String = sc.next()
  def ns(n: Int): Array[Char] = ns().toCharArray
  def na(n: Int, offset: Int = 0): Array[Int] = map(n)(_ => ni() + offset)
  def na2(n: Int, offset: Int = 0): (Array[Int], Array[Int]) = {
    val A1, A2 = Array.ofDim[Int](n)
    REP(n) { i =>
      A1(i) = ni() + offset
      A2(i) = ni() + offset
    }
    (A1, A2)
  }
  def nm(n: Int, m: Int): Array[Array[Int]] = {
    val A = Array.ofDim[Int](n, m)
    REP(n) { i =>
      REP(m) { j =>
        A(i)(j) = ni()
      }
    }
    A
  }
  def nal(n: Int): Array[Long] = map(n)(_ => nl())
  def nm_c(n: Int, m: Int): Array[Array[Char]] = map(n) (_ => ns(m))
  def REP(n: Int, offset: Int = 0)(f: Int => Unit): Unit = {
    var i = offset
    val N = n + offset
    while(i < N) { f(i); i += 1 }
  }
  def REP_r(n: Int, offset: Int = 0)(f: Int => Unit): Unit = {
    var i = n - 1 + offset
    while(i >= offset) { f(i); i -= 1 }
  }

  def map[@specialized A: ClassTag](n: Int, offset: Int = 0)(f: Int => A): Array[A] = {
    val res = Array.ofDim[A](n)
    REP(n)(i => res(i) = f(i + offset))
    res
  }


  def sumL(as: Array[Int]): Long = {
    var s = 0L
    REP(as.length)(i => s += as(i))
    s
  }

  def cumSum(as: Array[Int]) = {
    val cum = Array.ofDim[Long](as.length + 1)
    REP(as.length) { i =>
      cum(i + 1) = cum(i) + as(i)
    }
    cum
  }
}


Measured memory_bytes: 264816