#include <bits/stdc++.h>
using namespace std;
int n, m, head[200010], cnt = 1, st[200010], top, dfn[200010], ind;
vector<int> a[200010], b[200010], v[200010], w[200010];
bool vis[200010], inc[200010], flag;
char boo[200010];
queue<int> q;
struct edge {
  int to, next, w;
} e[400010];
inline void insert(int u, int v, int w) {
  e[++cnt].to = v, e[cnt].next = head[u], head[u] = cnt;
  e[cnt].w = w;
}
inline void dfs(int u, int fa) {
  vis[u] = inc[u] = 1;
  for (int i = head[u]; i; i = e[i].next) {
    int v = e[i].to, w = e[i].w;
    if (v == fa || inc[v]) continue;
    if (a[w][0] == v)
      boo[w] = '1';
    else
      boo[w] = '0';
    if (!inc[v]) dfs(v, u);
  }
}
inline void find(int u, int fa) {
  vis[u] = 1;
  for (int i = head[u]; i; i = e[i].next) {
    if (fa == (i ^ 1)) continue;
    int v = e[i].to, w = e[i].w;
    if (vis[v]) {
      if (flag) continue;
      flag = 1;
      for (int t = top; e[st[t]].to != v && t; t--) {
        int now = e[st[t]].to, w = e[st[t]].w;
        inc[now] = 1;
        if (a[w][0] == now)
          boo[w] = '1';
        else
          boo[w] = '0';
      }
      inc[v] = 1;
      if (a[w][0] == v)
        boo[w] = '1';
      else
        boo[w] = '0';
      for (int t = top; e[st[t]].to != v && t; t--) {
        dfs(e[st[t]].to, 0);
      }
      dfs(v, 0);
      continue;
    }
    st[++top] = i;
    find(v, i);
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) {
    int k;
    scanf("%d", &k);
    for (int j = 1; j <= k; j++) {
      int x;
      scanf("%d", &x);
      if (x < 0)
        b[-x].push_back(i);
      else
        a[x].push_back(i);
    }
  }
  for (int i = 1; i <= m; i++) {
    if (a[i].size() * b[i].size() == 0) {
      if (a[i].size() != 0) {
        boo[i] = '1';
        for (int j = 0; j < a[i].size(); j++) vis[a[i][j]] = 1;
      } else if (b[i].size() != 0) {
        boo[i] = '0';
        for (int j = 0; j < b[i].size(); j++) vis[b[i][j]] = 1;
      }
    } else {
      if (!vis[a[i][0]] && !vis[b[i][0]]) {
        v[a[i][0]].push_back(b[i][0]);
        w[a[i][0]].push_back(i);
        v[b[i][0]].push_back(a[i][0]);
        w[b[i][0]].push_back(i);
      } else if (!vis[a[i][0]]) {
        vis[a[i][0]] = 1;
        boo[i] = '1';
      } else {
        vis[b[i][0]] = 1;
        boo[i] = '0';
      }
    }
  }
  for (int i = 1; i <= n; i++)
    if (vis[i]) q.push(i);
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (int i = 0; i < v[u].size(); i++) {
      int y = v[u][i], val = w[u][i];
      if (vis[y]) continue;
      if (a[val][0] == y)
        boo[val] = '1';
      else
        boo[val] = '0';
      vis[y] = 1;
      q.push(y);
    }
  }
  for (int i = 1; i <= n; i++) {
    if (vis[i]) continue;
    for (int j = 0; j < v[i].size(); j++) {
      int y = v[i][j];
      if (vis[y] || i < y) continue;
      insert(i, y, w[i][j]);
      insert(y, i, w[i][j]);
    }
  }
  for (int i = 1; i <= n; i++) {
    if (!vis[i]) {
      flag = 0;
      top = 0;
      find(i, 0);
      if (!flag) {
        puts("NO");
        return 0;
      }
    }
  }
  puts("YES");
  for (int i = 1; i <= m; i++)
    if (!boo[i]) boo[i] = '0';
  puts(boo + 1);
  return 0;
}
