package adv2018; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.ArrayList; import java.util.Arrays; import java.util.Comparator; import java.util.InputMismatchException; import java.util.List; import java.util.TreeSet; public class Day23_5 { InputStream is; PrintWriter out; String INPUT = ""; static class State { String s; int[] rem; } void solve() { int n = ni(), K = ni(); int[] a = na(n); int[] f = new int[100]; for(int v : a)f[v]++; String[] xs = new String[99]; for(int i = 0;i < 99;i++)xs[i] = "" + (i+1); Arrays.sort(xs, new Comparator() { public int compare(String a, String b) { return -(a+b).compareTo(b+a); } }); int D = 20; int kind = 0; for(int i = 0;i < 100;i++){ if(f[i] > 0)kind++; } StringBuilder prefix = new StringBuilder(); for(int i = 0;i < 99;i++){ int v = Integer.parseInt(xs[i]); if(f[v] > 0 && kind > D){ kind--; for(int j = 0;j < f[v];j++){ prefix.append(v); } f[v] = 0; } } int[] map = new int[D]; int[] mf = new int[D]; int p = 0; for(int i = 0;i < 100;i++){ if(f[i] > 0){ map[p] = i; mf[p++] = f[i]; } } int len = 0; for(int i = 0;i < D;i++)len += (map[i] >= 10 ? 2 : 1) * mf[i]; Comparator comp = (x, y) -> x.s.compareTo(y.s); State ini = new State(); ini.s = ""; ini.rem = mf; TreeSet q = new TreeSet<>(comp); q.add(ini); List> lq = new ArrayList<>(); lq.add(q); for(int i = 0;i < len;i++){ TreeSet oq = new TreeSet<>(comp); lq.add(oq); } int W = 1500; int hit = 0; for(int i = 0;i < len;i++){ // tr(i, lq.get(i).size(), hit); for(State s : lq.get(i)){ for(int j = 0;j < D;j++){ if(s.rem[j] > 0){ int nlen = i + (map[j] >= 10 ? 2 : 1); String nex = s.s + map[j]; // if(lq.get(nlen).size() == W && // nex.compareTo(lq.get(nlen).first().s) < 0){ // continue; // } int[] nrem = Arrays.copyOf(s.rem, s.rem.length); nrem[j]--; State ns = new State(); ns.s = nex; ns.rem = nrem; if(lq.get(nlen).contains(ns)){ State bef = lq.get(nlen).ceiling(ns); int bal = 0; for(int k = 1;k <= 9;k++){ if(map[k] <= 9){ bal -= nrem[k]; bal += bef.rem[k]; } } if(bal < 0){ bef.rem = nrem; } }else{ lq.get(nlen).add(ns); if(lq.get(nlen).size() > W){ lq.get(nlen).pollFirst(); } } } } } } TreeSet last = lq.get(len); for(int i = 0;i < K;i++){ out.println(prefix.toString() + last.pollLast().s); } } void run() throws Exception { // int n = 99, m = 99999; // Random gen = new Random(); // StringBuilder sb = new StringBuilder(); // sb.append(n + " " + 1000 + "\n"); // for (int i = 0; i < n; i++) { // sb.append(gen.nextInt(99)+1 + " "); // } // INPUT = sb.toString(); is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new Day23_5().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }