CF1340B.Nastya and Scoreboard

Denis, after buying flowers and sweets (you will learn about this story in the next task), went to a date with Nastya to ask her to become a couple. Now, they are sitting in the cafe and finally... Denis asks her to be together, but ... Nastya doesn't give any answer.

The poor boy was very upset because of that. He was so sad that he punched some kind of scoreboard with numbers. The numbers are displayed in the same way as on an electronic clock: each digit position consists of $7$ segments, which can be turned on or off to display different numbers. The picture shows how all $10$ decimal digits are displayed:

After the punch, some segments stopped working, that is, some segments might stop glowing if they glowed earlier. But Denis remembered how many sticks were glowing and how many are glowing now. Denis broke exactly $k$ segments and he knows which sticks are working now. Denis came up with the question: what is the maximum possible number that can appear on the board if you turn on exactly $k$ sticks (which are off now)?

It is allowed that the number includes leading zeros.

丹尼斯在买了鲜花和糖果之后（这个故事将在下一题中讲述），便去和娜斯佳约会，向她求婚。此刻，他们正坐在咖啡馆里，终于……丹尼斯向她表白，希望两人成为情侣，但……娜斯佳却未作任何回应。

可怜的男孩因此非常沮丧。他悲伤至极，一拳砸向了一块显示数字的电子计分板。这些数字的显示方式与电子钟相同：每个数位由 $7$ 个可独立点亮或熄灭的线段组成，从而显示不同的数字。下图展示了全部 $10$ 个十进制数字的显示方式：

这一拳导致部分线段损坏——即原本点亮的某些线段可能因此熄灭。但丹尼斯记得最初有多少根线段是点亮的，以及现在还有多少根线段仍在点亮。丹尼斯恰好打坏了 $k$ 根线段，且他知道当前哪些线段仍能正常工作。于是他提出了一个问题：如果恰好点亮 $k$ 根目前熄灭的线段（即“开启”这 $k$ 根线段），那么计分板上所能显示的最大可能数字是多少？

允许该数字包含前导零。

The first line contains integer $n$ $(1 \leq n \leq 2000)$ — the number of digits on scoreboard and $k$ $(0 \leq k \leq 2000)$ — the number of segments that stopped working.

The next $n$ lines contain one binary string of length $7$, the $i$-th of which encodes the $i$-th digit of the scoreboard.

Each digit on the scoreboard consists of $7$ segments. We number them, as in the picture below, and let the $i$-th place of the binary string be $0$ if the $i$-th stick is not glowing and $1$ if it is glowing. Then a binary string of length $7$ will specify which segments are glowing now.

Thus, the sequences "1110111", "0010010", "1011101", "1011011", "0111010", "1101011", "1101111", "1010010", "1111111", "1111011" encode in sequence all digits from $0$ to $9$ inclusive.

第一行包含两个整数 $n$（$1 \leq n \leq 2000$）——计分板上的数字个数，以及 $k$（$0 \leq k \leq 2000$）——失效的线段数量。

接下来的 $n$ 行，每行包含一个长度为 $7$ 的二进制字符串，其中第 $i$ 行表示计分板上第 $i$ 个数字的编码。

计分板上的每个数字由 $7$ 根线段组成。我们按如下图所示对这些线段编号，并令该二进制字符串的第 $i$ 位为 $0$ 表示第 $i$ 根线段不发光，为 $1$ 表示第 $i$ 根线段发光。因此，一个长度为 $7$ 的二进制字符串即可描述当前哪些线段处于发光状态。

于是，字符串序列 "1110111"、"0010010"、"1011101"、"1011011"、"0111010"、"1101011"、"1101111"、"1010010"、"1111111"、"1111011" 依次对应数字 $0$ 至 $9$（含端点）。

Output a single number consisting of $n$ digits — the maximum number that can be obtained if you turn on exactly $k$ sticks or $-1$, if it is impossible to turn on exactly $k$ sticks so that a correct number appears on the scoreboard digits.

输出一个由 $n$ 位数字组成的单个数字——即在恰好点亮 $k$ 根火柴棒的前提下所能得到的最大数字；若无法恰好点亮 $k$ 根火柴棒从而在计分板数字上显示一个合法数字，则输出 $-1$。

In the first test, we are obliged to include all $7$ sticks and get one $8$ digit on the scoreboard.

In the second test, we have sticks turned on so that units are formed. For $5$ of additionally included sticks, you can get the numbers $07$, $18$, $34$, $43$, $70$, $79$, $81$ and $97$, of which we choose the maximum — $97$.

In the third test, it is impossible to turn on exactly $5$ sticks so that a sequence of numbers appears on the scoreboard.

在第一个测试用例中，我们必须使用全部 $7$ 根火柴棒，在计分板上组成一个 $8$ 位数字。

在第二个测试用例中，已有若干根火柴棒被点亮以构成个位数字。对于额外加入的 $5$ 根火柴棒，可以得到的数字有 $07$、$18$、$34$、$43$、$70$、$79$、$81$ 和 $97$，其中最大值为 $97$。

在第三个测试用例中，无法恰好点亮 $5$ 根火柴棒，使得计分板上显示一串数字。