#include <bits/stdc++.h>
using namespace std;
void bad(string mes = "Impossible") {
  cout << mes;
  exit(0);
}
template <typename... T>
void shit(T&... x) {}
template <typename... T>
void dec(T&... x) {
  shit(--x...);
}
template <typename... T>
void inc(T&... x) {
  shit(++x...);
}
template <typename T>
string bin(T x, int st = 2) {
  string ans = "";
  while (x > 0) {
    ans += char('0' + x % st);
    x /= st;
  }
  reverse(ans.begin(), ans.end());
  return ans.empty() ? "0" : ans;
}
template <typename T>
T input() {
  T ans = 0, m = 1;
  char c = ' ';
  while (!((c >= '0' && c <= '9') || c == '-')) {
    c = getchar();
  }
  if (c == '-') m = -1, c = getchar();
  while (c >= '0' && c <= '9') {
    ans = ans * 10 + (c - '0'), c = getchar();
  }
  return ans * m;
}
template <typename T>
void read(T& a) {
  a = input<T>();
}
template <typename T>
void read(T& a, T& b) {
  read(a), read(b);
}
template <typename T>
void read(T& a, T& b, T& c) {
  read(a, b), read(c);
}
template <typename T>
void read(T& a, T& b, T& c, T& d) {
  read(a, b), read(c, d);
}
const int inf = 1e9;
const double eps = 1e-9;
const int maxn = 1e6 + 100, base = 1e9 + 7;
const long long llinf = 1e18 + 1;
template <typename T>
T binpow(T n, T second) {
  if (second <= 0) return 1LL;
  if (second % 2 == 0) {
    T b = binpow(n, second / 2);
    return (1LL * b * b) % base;
  } else {
    return (1LL * binpow(n, second - 1) * n) % base;
  }
}
vector<int> evil_to_trainer[maxn];
int conference[maxn];
int team[maxn];
vector<int> teams_availible[maxn];
int degree[maxn];
set<pair<int, int> > q;
void solve() {
  int n, e;
  read(n, e);
  for (int i = 0; i < e; i++) {
    int first, t;
    read(first, t);
    first--, t--;
    degree[first]++;
    degree[t]++;
    evil_to_trainer[first].push_back(t);
    evil_to_trainer[t].push_back(first);
  }
  int mx = 0;
  for (int i = 0; i < n; i++) {
    q.insert(make_pair(degree[i], i));
    int l;
    read(l);
    for (int j = 0; j < l; j++) {
      int cur;
      read(cur);
      cur--;
      teams_availible[i].push_back(cur);
      mx = max(mx, cur);
    }
    random_shuffle((teams_availible[i]).begin(), (teams_availible[i]).end());
  }
  while (!q.empty()) {
    int v = (*(--q.end())).second;
    q.erase(--q.end());
    int my_team = team[v];
    if (my_team == 0) {
      my_team = teams_availible[v].front();
      team[v] = my_team;
      if (conference[my_team] == 0) conference[my_team] = 1;
    }
    for (int to : evil_to_trainer[v]) {
      if (team[to] != 0) continue;
      q.erase(make_pair(degree[to], to));
      degree[to]--;
      for (int team_of_him : teams_availible[to]) {
        if (conference[team_of_him] != conference[my_team]) {
          team[to] = team_of_him;
          if (conference[team_of_him] == 0)
            conference[team_of_him] = conference[my_team] ^ 3;
          break;
        }
      }
      q.insert(make_pair(degree[to], to));
    }
  }
  for (int i = 0; i < n; i++) printf("%d ", team[i] + 1);
  puts("");
  for (int i = 0; i <= mx; i++)
    printf("%d ", conference[i] == 0 ? 1 : conference[i]);
}
int main() {
  solve();
  return 0;
}
