#include <bits/stdc++.h>

// #define int int64_t

const int kMaxN = 105, kMaxM = 1e4 + 5;

int n, m;
int u[kMaxM], v[kMaxM];

namespace Sub1 {
std::vector<std::vector<int>> res;

bool check() {
  if (m != n - 1) return 0;
  for (int i = 1; i <= m; ++i)
    if (u[i] != 1 && v[i] != 1)
      return 0;
  return 1;
}

void solve() {
  std::vector<int> tmp;
  for (int i = 1; i <= n; ++i) tmp.emplace_back(1);
  res.emplace_back(tmp);
  for (auto &x : tmp) x = 0;
  tmp[0] = tmp[1] = 1;
  res.emplace_back(tmp);
  for (auto &x : tmp) x = 1;
  res.emplace_back(tmp);
  std::cout << res.size() << '\n';
  for (auto &vec : res) {
    for (auto x : vec) std::cout << x << ' ';
    std::cout << '\n';
  }
}
} // namespace Sub1

namespace Sub2 {
bool check() {
  if (m == n * (n - 1) / 2) return 1;
  if (m != n - 1) return 0;
  for (int i = 1; i <= m; ++i)
    if (abs(u[i] - v[i]) != 1)
      return 0;
  return 1;
}

void solve() {
  std::cout << 450 << '\n';
  for (int i = 1; i <= 450; ++i) {
    if (i & 1) {
      for (int j = 1; j <= n; ++j) {
        std::cout << (j - 1) / 2 + 1 << ' ';
      }
      std::cout << '\n';
    } else {
      for (int j = 1; j <= n; ++j)
        std::cout << j / 2 << ' ';
      std::cout << '\n';
    }
  }
}
} // namespace Sub2

void dickdreamer() {
  std::cin >> n >> m;
  for (int i = 1; i <= m; ++i) {
    std::cin >> u[i] >> v[i];
    ++u[i], ++v[i];
  }
  if (Sub1::check()) Sub1::solve();
  else if (Sub2::check()) Sub2::solve();
}

int32_t main() {
#ifdef ORZXKR
  freopen("in.txt", "r", stdin);
  freopen("out.txt", "w", stdout);
#endif
  std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0);
  int T = 1;
  // std::cin >> T;
  while (T--) dickdreamer();
  // std::cerr << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
  return 0;
}