#include <bits/stdc++.h>
using namespace std;
struct Edge {
  int v, next;
} en[200005];
int cnt, head[50005];
void init() {
  cnt = 0;
  memset(head, -1, sizeof(head));
}
void add(int u, int v) {
  en[cnt].v = v;
  en[cnt].next = head[u];
  head[u] = cnt++;
  en[cnt].v = u;
  en[cnt].next = head[v];
  head[v] = cnt++;
}
int ans[1000005];
int tt[50005];
int a[50005][25], num[50005];
int vis[50005];
void dfs(int x, int c) {
  vis[x] = c;
  for (int i = head[x]; i != -1; i = en[i].next) {
    int v = en[i].v;
    if (!vis[v]) dfs(v, 3 - c);
  }
}
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  init();
  set<int> se;
  while (m--) {
    int u, v;
    scanf("%d%d", &u, &v);
    add(u, v);
    se.insert(u);
    se.insert(v);
  }
  int i, j, t = 0;
  memset(ans, 0, sizeof(ans));
  for (i = 1; i <= n; i++) {
    scanf("%d", &num[i]);
    for (j = 1; j <= num[i]; j++) {
      scanf("%d", &a[i][j]);
      t = max(t, a[i][j]);
      ans[a[i][j]] = 1;
    }
  }
  memset(vis, 0, sizeof(vis));
  for (auto &i : se) {
    if (!vis[i]) dfs(i, 1);
  }
  for (i = 1; i <= n; i++) {
    if (vis[i] == 2) {
      bool flag = 0;
      for (j = 1; j <= num[i]; j++) {
        int temp = a[i][j];
        if (ans[temp] == 2) {
          flag = 1;
          tt[i] = temp;
          break;
        }
      }
      if (!flag) {
        ans[a[i][1]] = 2;
        tt[i] = a[i][1];
      }
    } else if (vis[i] == 1) {
      for (j = 1; j <= num[i]; j++) {
        if (ans[a[i][j]] == 1) break;
      }
      tt[i] = a[i][j];
    } else
      tt[i] = a[i][1];
  }
  for (i = 1; i <= n; i++) printf("%d%c", tt[i], i == n ? '\n' : ' ');
  bool first = 1;
  for (i = 1; i <= 1000000; i++) {
    if (ans[i]) {
      if (first)
        first = 0;
      else
        printf(" ");
      printf("%d", ans[i]);
    }
  }
  printf("\n");
  return 0;
}
