#include <bits/stdc++.h>
using namespace std;
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  os << '{';
  string sep;
  for (const auto &x : v) os << sep << x, sep = ", ";
  return os << '}';
}
template <typename T, size_t size>
ostream &operator<<(ostream &os, const array<T, size> &arr) {
  os << '{';
  string sep;
  for (const auto &x : arr) os << sep << x, sep = ", ";
  return os << '}';
}
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
void error() { cerr << endl; }
template <typename Head, typename... Tail>
void error(Head H, Tail... T) {
  cerr << ' ' << H;
  error(T...);
}
void Solve();
int main() {
  Solve();
  return 0;
}
using LL = long long;
const int N = 2e6 + 5, INF = 0x3f3f3f3f;
vector<pair<int, int>> g[N], fa[N];
int n;
int vis[N], dis[N], que[N], st, ed;
void bfs() {
  for (int i = 1; i <= n; i++) {
    vis[i] = 0;
    dis[i] = INF;
  }
  st = 1, ed = 0;
  dis[1] = 0;
  que[++ed] = 1;
  vis[1] = 1;
  while (st <= ed) {
    int x = que[st++];
    for (auto v : g[x]) {
      if (!vis[v.first]) {
        vis[v.first] = 1;
        dis[v.first] = dis[x] + 1;
        que[++ed] = v.first;
      }
      if (dis[v.first] == dis[x] + 1) {
        fa[v.first].push_back({x, v.second});
      }
    }
  }
}
int limit;
int mark_edge[N], m;
int choose[N];
void output(int x) {
  if (x > n) {
    if (!limit) {
      exit(0);
    }
    for (int i = 2; i <= n; i++) mark_edge[choose[i]] = 1;
    for (int i = 1; i <= m; i++) {
      if (mark_edge[i])
        cout << 1, mark_edge[i] = 0;
      else
        cout << 0;
    }
    cout << '\n';
    limit--;
    return;
  }
  for (auto v : fa[x]) {
    choose[x] = v.second;
    output(x + 1);
  }
}
void Solve() {
  cin >> n >> m >> limit;
  for (int i = 1; i <= m; i++) {
    int u, v;
    cin >> u >> v;
    if (u > v) swap(u, v);
    g[u].push_back({v, i}), g[v].push_back({u, i});
  }
  bfs();
  int ans = 1;
  for (int i = 2; i <= n; i++) {
    if ((LL)ans * fa[i].size() > limit)
      ans = limit;
    else
      ans *= fa[i].size();
  }
  cout << min(limit, ans) << endl;
  output(2);
}
