import random import heapq import copy def is_prime(n, k=50): assert n > 0 if n == 2: return True elif n == 1 or n % 2 == 0: return False d = n - 1 s = 0 while d % 2 == 0: d //= 2 s += 1 for i in range(k): a = random.randint(1, n - 1) if pow(a, d, n) != 1: for r in range(0, s): if pow(a, d * 2 ** r, n) == n - 1: break else: return False return True class number(object): def __init__(self, num, n, cards): self.num = num self.n = n self.cards = cards def __lt__(self, other): for i in range(min(len(self.num),len(other.num))): if self.num[i] != other.num[i]: return self.num[i] > other.num[i] return len(self.num) < len(other.num) def __eq__(self, other): if not isinstance(other, number): return False return self.num == other.num and self.cards == other.cards def __hash__(self): return hash(str(self.cards) + self.num) n, k = map(int, input().split()) if n == 1: print(input()) sys.exit() a = [0] * 100 l = list(map(int, input().split())) for i in l: a[i] += 1 q = [] s = set() heapq.heappush(q, number('', n, a)) while k > 0: top = heapq.heappop(q) if top in s: continue s.add(top) if top.n == 0: if is_prime(int(top.num)): print(top.num) k -= 1 continue b = True for i in range(1, 100, 2): if(top.cards[i] != 0): b = False break if b: continue b = True for i in range(1, 10): if(top.cards[i] != 0): b = False break if b: c = 0 if top.num == '' else int(top.num) % 11 for i in range(10, 100): c += i * top.cards[i] if c % 11 == 0: continue for i in range(1, 100): if top.cards[i] > 0: cards = copy.copy(top.cards) cards[i] -= 1 heapq.heappush(q, number(top.num + str(i), top.n - 1, cards))