dp_solution_print

problem link::https://codeforces.com/contest/1341/problem/D  (Nastya and Scoreboard)

#include <bits/stdc++.h>
using namespace std;
#define ll long long int
const int mx = 2e3 + 5;
int n, k;
int dp[mx][mx];
string s[mx];
string dig[] = {"1110111", "0010010", "1011101", "1011011", "0111010",
                "1101011", "1101111", "1010010", "1111111", "1111011"};
struct direction {
  int i, c, ans;
  direction(){};
  direction(int i, int c, int ans) : i(i), c(c), ans(ans){};
} dir[mx][mx];

int zero_to_one(string s1, string s2) {
  int cnt = 0;
  for (int i = 0; i < s1.size(); i++) {
    if (s1[i] == '0' && s2[i] == '1') {
      return -1;
    }
    if (s1[i] == '1' && s2[i] == '0') {
      cnt++;
    }
  }
  return cnt;
}
int solve(int i, int cost) {
  if (i == n) {
    return k == cost;
  }
  if (dp[i][cost] != -1) {
    return dp[i][cost];
  }
  int res = 0;
  for (int m = 9; m >= 0; m--) {
    string s1 = dig[m];
    int check = zero_to_one(s1, s[i]);
    if (check == -1) {
      continue;
    }
    if (cost + check <= k) {
      int st = solve(i + 1, cost + check);
      if (st == 1) {
        res = 1;
        dir[i][cost] = direction(i + 1, cost + check, m);
      }
    }
  }
  return dp[i][cost] = res;
}
void print(int i, int cost) {
  if (dir[i][cost].ans == -1) {
    return;
  }
  cout << dir[i][cost].ans;
  print(dir[i][cost].i, dir[i][cost].c);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  memset(dp, -1, sizeof(dp));
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> s[i];
  }
  memset(dir, -1, sizeof(dir));
  int val = solve(0, 0);
  if (val == 0) {
    cout << -1 << "\n";
  } else {
    print(0, 0);
  }
  return 0;
}