D. Nastya and Scoreboard

链接：https://codeforces.ml/contest/1341/problem/C

Denis, who managed to buy flowers and sweets (you will learn about this story in the next task), went to a meeting with Nastya to invite her to become a couple. And so, they sit together in a cafe, chatting. Denis finally offers to be them together, but ... Nastya doesn't give any answer.

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

After the kick, some sticks stopped working, that is, some sticks might stop glowing if they glowed earlier. But Denis remembered how many sticks were glowing and how many are glowing now. Let exactly kk sticks break and we know which sticks are working now. Denis came up with the question: what is the maximum number that can burn on the board if you turn on exactly kk sticks (which are off now)?

It is allowed that the number includes leading zeros.

Input

The first line contains integer nn (1≤n≤2000)(1≤n≤2000)  — the number of digits on scoreboard and kk (0≤k≤2000)(0≤k≤2000)  — the number of sticks that stopped working.

The next nn lines contain one binary string of length 77, the ii-th of which encodes the ii-th digit of the scoreboard.

Each digit on the scoreboard consists of 77 sticks. We number them, as in the picture below, and let the ii-th place of the binary string be 00 if the ii-th stick is not glowing and 11 if it is glowing. Then a binary string of length 77 will specify which sticks glowing.

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

Output

Print a single number consisting of nn digits  — the maximum number that can be obtained if you turn on exactly kk sticks or −1−1, if it is impossible to turn on exactly kk sticks so that some sort of sequence appears on the scoreboard digits.

Examples

input

Copy

1 7
0000000

output

Copy

8

input

Copy

2 5
0010010
0010010

output

Copy

97

input

Copy

3 5
0100001
1001001
1010011

output

Copy

-1

Note

In the first test, we are obliged to include all 77 sticks and get one 88 digit on the scoreboard.

In the second test, we have sticks turned on so that units are formed. For 55 of additionally included sticks, you can get the numbers 0707, 1818, 3434, 4343, 7070, 7979, 8181 and 9797, of which we choose the maximum  — 9797.

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

代码：

#include<bits/stdc++.h>
using namespace std;
char num[10][8]={"1110111","0010010","1011101","1011011",
"0111010","1101011","1101111","1010010","1111111","1111011"};
long long n,k,flag=0;
long long al[2005][2005]={0};
char a[2005][8];
long long ans[2005];
void dfs(long long x)
{
	if(x==n) 
	{
		if(k==0) 
		{
			for(int i=0;i<n;i++) 
			cout<<ans[i];
			cout<<endl;
			flag=1;
		}
		return;
	}
	for (int i=9;i>=0;i--)
	{
		long long b=1,t=0;
		for(int j=0;j<7;j++)
		{
			if(a[x][j]=='1'&&num[i][j]=='0')
			{
				b=0;
				break;
			}
			else if(a[x][j]=='0'&&num[i][j]=='1') 
			t++;
		}
		if(b!=0&&k>=t&&al[x][k-t]==0)
		{
			al[x][k-t]=1;
			ans[x]=i;
			k-=t;
			dfs(x+1);
			if(flag==1) 
			return;
			k+=t;
		}
	}
}
int main()
{
	cin>>n>>k;
	for (int i=0;i<n;i++)
	{
		cin>>a[i];
	}
	dfs(0);
	if(flag==0) 
	cout<<"-1"<<endl;
	return 0;
}