#include <bits/stdc++.h>
std::mt19937 rgn(std::chrono::steady_clock::now().time_since_epoch().count());
using namespace std;
namespace io {
template <typename T>
inline void read(T& a) {
  int c = getchar(), sign = 0;
  a = 0;
  while (c < '0' || c > '9') sign += (c == '-'), c = getchar();
  while (c >= '0' && c <= '9') a = (a << 1) + (a << 3) + c - 48, c = getchar();
  if (sign & 1) a = -a;
}
template <typename T, typename... _T>
inline void read(T& a, _T&... argc) {
  read(a);
  read(argc...);
}
template <typename T>
inline void Write(T a) {
  if (a > 9) Write(a / 10);
  putchar(a % 10 + '0');
}
template <typename T>
inline void write(T a, char ch = ' ') {
  if (a < 0) putchar('-'), a = -a;
  Write(a);
  putchar(ch);
}
template <typename T>
inline void Min(T& a, T b) {
  if (a > b) a = b;
}
template <typename T>
inline void Max(T& a, T b) {
  if (a < b) a = b;
}
template <typename T, typename... _T>
inline void Min(T& a, T b, _T... c) {
  Min(a, b);
  Min(a, c...);
}
template <typename T, typename... _T>
inline void Max(T& a, T b, _T... c) {
  Max(a, b);
  Max(a, c...);
}
}  // namespace io
using namespace io;
const int maxn = 1e6 + 3;
const int N = 4e5 + 3;
const int mod = 1e9 + 7;
int n, m, q;
int dem[N], id[N], chot[N], a[N], b[N];
int k, h;
long long t[N + 3];
string s;
bool kt[N];
map<long long, int> maps;
vector<int> edge[N];
map<int, int>::iterator it;
template <typename T>
void answer(T x) {
  cout << x;
  exit(0);
}
void putstring(string x, char ch = ' ') {
  for (char c : x) putchar(c);
  putchar(ch);
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL);
  cin >> n >> k;
  vector<string> encode = {"1110111", "0010010", "1011101", "1011011",
                           "0111010", "1101011", "1101111", "1010010",
                           "1111111", "1111011"};
  auto rein = [&](string& s) {
    int ans = 0;
    for (int i = 0; i < (int)s.size(); i++)
      if (s[i] == '1') ans |= 1 << i;
    return ans;
  };
  vector<int> digit(10);
  for (int i = 0; i < 10; i++) digit[i] = rein(encode[i]);
  vector<string> s(n + 1);
  for (int i = 1; i <= n; i++) cin >> s[i];
  vector<vector<short>> dp(n + 2, vector<short>(k + 1, -1));
  dp[n + 1][0] = 0;
  for (int i = n; i >= 1; i--) {
    int now = rein(s[i]);
    for (int idx = 0; idx < 10; idx++) {
      if ((now | digit[idx]) != digit[idx]) continue;
      int can = now ^ digit[idx];
      can = __builtin_popcount(can);
      for (int j = can; j <= k; j++) {
        if (dp[i + 1][j - can] == -1) continue;
        dp[i][j] = idx;
      }
    }
  }
  if (dp[1][k] == -1)
    cout << "-1";
  else {
    for (int i = 1; i <= n; i++) {
      cout << dp[i][k];
      k -= __builtin_popcount(rein(s[i]) ^ digit[dp[i][k]]);
    }
    assert(!k);
  }
}
