#include <bits/stdc++.h>
using namespace std;
const long long int maxn = (5e5) + 10, mod = 1e9 + 7, inf = INT_MAX;
long long int n, m, mark[2][maxn], p[maxn], ans[maxn], cnt[maxn];
bool mrk[maxn], vis[maxn], flg;
vector<long long int> v[maxn], G[maxn];
pair<long long int, long long int> edg[maxn], res[maxn];
long long int R(string s) {
  long long int res = 0;
  for (long long int i = 0; i < (long long int)s.size(); i++)
    res = (res * 10) + (s[i] - '0');
  return res;
}
inline void T(long long int &x) { x = abs(x); }
void fnd(long long int v) {
  mrk[v] = 1;
  for (long long int u : G[v]) {
    if (vis[u]) continue;
    long long int child = edg[u].first ^ edg[u].second ^ v;
    if (mrk[child] && !flg) {
      vis[u] = 1;
      flg = 1;
      if (child == edg[u].second)
        ans[u] = 2;
      else
        ans[u] = 1;
      long long int rr = child;
      while (p[rr]) {
        long long int uu = edg[p[rr] - 1].first ^ edg[p[rr] - 1].second ^ rr;
        if (uu == edg[p[rr] - 1].second)
          ans[p[rr] - 1] = 2;
        else
          ans[p[rr] - 1] = 1;
        rr = uu;
      }
      continue;
    }
    vis[u] = 1;
    if (child == edg[u].second)
      ans[u] = 2;
    else
      ans[u] = 1;
    if (mrk[child]) continue;
    p[child] = u + 1;
    fnd(child);
  }
}
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  for (long long int i = 1; i <= n; i++) {
    long long int x;
    cin >> x;
    for (long long int j = 0; j < x; j++) {
      string s;
      cin >> s;
      if (s[0] == '-')
        v[i].push_back((-1) * R(s.substr(1, s.size() - 1)));
      else
        v[i].push_back(R(s));
    }
  }
  for (long long int i = 1; i <= n; i++)
    for (long long int j : v[i]) {
      if (j < 0) {
        if (!mark[0][-j])
          mark[0][-j] = -i;
        else
          mark[1][-j] = -i;
      } else {
        if (!mark[0][j])
          mark[0][j] = i;
        else
          mark[1][j] = i;
      }
    }
  long long int rr = 1;
  for (long long int i = 1; i <= m; i++) {
    if (!mark[0][i]) continue;
    if (!mark[1][i]) {
      if (mark[0][i] < 0)
        res[rr] = make_pair(i, 2);
      else
        res[rr] = make_pair(i, 3);
      T(mark[0][i]);
      G[mark[0][i]].push_back(rr);
      edg[rr++] = make_pair(mark[0][i], mark[0][i]);
    } else {
      if (mark[0][i] * mark[1][i] < 0) {
        res[rr].first = i;
        if (mark[0][i] < 0)
          res[rr].second = 0;
        else
          res[rr].second = 1;
        T(mark[0][i]);
        T(mark[1][i]);
        G[mark[0][i]].push_back(rr);
        G[mark[1][i]].push_back(rr);
        edg[rr++] = make_pair(mark[0][i], mark[1][i]);
      } else {
        if (mark[0][i] < 0)
          res[rr] = res[rr + 1] = make_pair(i, 2);
        else
          res[rr] = res[rr + 1] = make_pair(i, 3);
        T(mark[0][i]);
        G[mark[0][i]].push_back(rr);
        edg[rr++] = make_pair(mark[0][i], mark[0][i]);
        T(mark[1][i]);
        G[mark[1][i]].push_back(rr);
        edg[rr++] = make_pair(mark[1][i], mark[1][i]);
      }
    }
  }
  for (long long int i = 1; i <= n; i++) {
    flg = 0;
    if (!mrk[i]) {
      fnd(i);
      if (!flg) return cout << "NO" << '\n', 0;
    }
  }
  for (long long int i = 0; i < rr; i++) {
    if (ans[i] == 2 || ans[i] == 0) {
      if (res[i].second == 3)
        cnt[res[i].first] = 1;
      else if (res[i].second == 2)
        cnt[res[i].first] = 0;
      else if (res[i].second == 0)
        cnt[res[i].first] = 1;
      else if (res[i].second == 1)
        cnt[res[i].first] = 0;
    } else {
      if (res[i].second == 3)
        cnt[res[i].first] = 1;
      else if (res[i].second == 2)
        cnt[res[i].first] = 0;
      else if (res[i].second == 0)
        cnt[res[i].first] = 0;
      else if (res[i].second == 1)
        cnt[res[i].first] = 1;
    }
  }
  cout << "YES" << '\n';
  for (long long int i = 1; i <= m; i++) cout << cnt[i];
}
