#include <bits/stdc++.h>
using namespace std;
const int N = 50010;
const int MAXT = 1000010;
int n, e;
vector<int> E[N];
int l[N];
int t[N][30];
int ans[N];
int group[N];
bool vis[MAXT];
int color[MAXT];
int T;
bool ok = false;
void dfs(int v) {
  if (v == n + 1) {
    ok = true;
    return;
  }
  for (int i = 1; i <= l[v]; i++) {
    int u = t[v][i];
    if (vis[u] && color[u] == group[v]) {
      ans[v] = u;
      dfs(v + 1);
      if (ok) return;
      return;
    }
  }
  for (int i = 1; i <= l[v]; i++) {
    int u = t[v][i];
    if (!vis[u]) {
      vis[u] = true;
      color[u] = group[v];
      ans[v] = u;
      dfs(v + 1);
      if (ok) return;
      vis[u] = false;
      color[u] = 1;
    }
  }
}
int main() {
  scanf("%d%d", &n, &e);
  for (int i = 1, v, u; i <= e; i++) {
    scanf("%d%d", &v, &u);
    E[v].push_back(u);
    E[u].push_back(v);
  }
  for (int i = 1; i <= n; i++) {
    scanf("%d", &l[i]);
    for (int j = 1; j <= l[i]; j++) {
      scanf("%d", &t[i][j]);
      T = max(T, t[i][j]);
    }
  }
  group[1] = 1;
  for (int i = 2; i <= n; i++) {
    int cnt1 = 0, cnt2 = 0;
    for (auto j : E[i]) {
      if (j < i) {
        if (group[j] == 1)
          cnt1++;
        else
          cnt2++;
      }
    }
    if (cnt1 > cnt2)
      group[i] = 2;
    else
      group[i] = 1;
  }
  for (int i = 1; i <= T; i++) color[i] = 1;
  dfs(1);
  for (int i = 1; i <= n; i++) printf("%d%c", ans[i], " \n"[i == n]);
  for (int i = 1; i <= T; i++) printf("%d%c", color[i], " \n"[i == T]);
  return 0;
}
