#include <bits/stdc++.h>
template <class t>
inline void read(t &s) {
  s = 0;
  register int f = 1;
  register char c = getchar();
  while (!isdigit(c)) {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (isdigit(c)) s = (s << 3) + (s << 1) + (c ^ 48), c = getchar();
  s *= f;
  return;
}
template <class t, class... A>
inline void read(t &x, A &...a) {
  read(x);
  read(a...);
}
template <class t>
inline void write(t x) {
  if (x < 0) putchar('-'), x = -x;
  int buf[21], top = 0;
  while (x) buf[++top] = x % 10, x /= 10;
  if (!top) buf[++top] = 0;
  while (top) putchar(buf[top--] ^ '0');
  return;
}
inline void setIn(std::string s) {
  freopen(s.c_str(), "r", stdin);
  return;
}
inline void setOut(std::string s) {
  freopen(s.c_str(), "w", stdout);
  return;
}
inline void setIO(std::string s = "") {
  setIn(s + ".in");
  setOut(s + ".out");
  return;
}
template <class t>
inline bool ckmin(t &x, t y) {
  if (x > y) {
    x = y;
    return 1;
  }
  return 0;
}
template <class t>
inline bool ckmax(t &x, t y) {
  if (x < y) {
    x = y;
    return 1;
  }
  return 0;
}
inline int lowbit(int x) { return x & (-x); }
const int MaxN = 1e5 + 50;
int to[MaxN], c[MaxN], n, E, T;
int u[MaxN], v[MaxN];
std::vector<int> a[MaxN];
inline bool solve() {
  for (int i = 1; i <= n; ++i) to[i] = a[i][rand() % (int)a[i].size()];
  for (int i = 1; i <= T; ++i) c[i] = (rand() % 10000 <= 5000) + 1;
  long long s = 0;
  for (int i = 1; i <= E; ++i)
    if (c[to[u[i]]] != c[to[v[i]]]) ++s;
  return s * 2 >= E;
}
signed main(void) {
  srand(time(NULL));
  read(n, E);
  for (int i = 1; i <= E; ++i) read(u[i], v[i]);
  for (int i = 1; i <= n; ++i) {
    int len, x;
    read(len);
    while (len--) read(x), a[i].push_back(x), ckmax(T, x);
  }
  while (!solve())
    ;
  for (int i = 1; i <= n; ++i) write(to[i]), std::putchar(32);
  std::puts("");
  for (int i = 1; i <= T; ++i) write(c[i]), std::putchar(32);
  std::puts("");
  return 0;
}
