Problem: There are n cities in Berland. Some pairs of cities are connected by roads. All roads are bidirectional. Each road connects two different cities. There is at most one road between a pair of cities. The cities are numbered from 1 to n.

It is known that, from the capital (the city with the number 1), you can reach any other city by moving along the roads.

The President of Berland plans to improve the country's road network. The budget is enough to repair exactly n-1 roads. The President plans to choose a set of n-1 roads such that:

  * it is possible to travel from the capital to any other city along the n-1 chosen roads, 
  * if d_i is the number of roads needed to travel from the capital to city i, moving only along the n-1 chosen roads, then d_1 + d_2 + ... + d_n is minimized (i.e. as minimal as possible). 



In other words, the set of n-1 roads should preserve the connectivity of the country, and the sum of distances from city 1 to all cities should be minimized (where you can only use the n-1 chosen roads).

The president instructed the ministry to prepare k possible options to choose n-1 roads so that both conditions above are met.

Write a program that will find k possible ways to choose roads for repair. If there are fewer than k ways, then the program should output all possible valid ways to choose roads.

Input

The first line of the input contains integers n, m and k (2 ≤ n ≤ 2⋅10^5, n-1 ≤ m ≤ 2⋅10^5, 1 ≤ k ≤ 2⋅10^5), where n is the number of cities in the country, m is the number of roads and k is the number of options to choose a set of roads for repair. It is guaranteed that m ⋅ k ≤ 10^6.

The following m lines describe the roads, one road per line. Each line contains two integers a_i, b_i (1 ≤ a_i, b_i ≤ n, a_i ≠ b_i) — the numbers of the cities that the i-th road connects. There is at most one road between a pair of cities. The given set of roads is such that you can reach any city from the capital.

Output

Print t (1 ≤ t ≤ k) — the number of ways to choose a set of roads for repair. Recall that you need to find k different options; if there are fewer than k of them, then you need to find all possible different valid options.

In the following t lines, print the options, one per line. Print an option as a string of m characters where the j-th character is equal to '1' if the j-th road is included in the option, and is equal to '0' if the road is not included. The roads should be numbered according to their order in the input. The options can be printed in any order. All the t lines should be different.

Since it is guaranteed that m ⋅ k ≤ 10^6, the total length of all the t lines will not exceed 10^6.

If there are several answers, output any of them.

Examples

Input

4 4 3
1 2
2 3
1 4
4 3


Output

2
1110
1011


Input

4 6 3
1 2
2 3
1 4
4 3
2 4
1 3


Output

1
101001


Input

5 6 2
1 2
1 3
2 4
2 5
3 4
3 5


Output

2
111100
110110

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
struct edge {
  int to, id;
};
int n, m, k, D[200005], V[200005];
vector<edge> G[200005];
vector<int> U[200005];
vector<string> ans;
queue<int> Q;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> m >> k;
  for (int i = 0, x, y; i < m; ++i) {
    cin >> x >> y;
    G[x].emplace_back(edge{y, i});
    G[y].emplace_back(edge{x, i});
  }
  D[1] = 1;
  Q.push(1);
  while (!Q.empty()) {
    int x = Q.front();
    Q.pop();
    for (edge i : G[x])
      if (!D[i.to]) {
        D[i.to] = D[x] + 1;
        U[i.to].emplace_back(i.id);
        Q.push(i.to);
      } else if (D[x] + 1 == D[i.to])
        U[i.to].emplace_back(i.id);
  }
  while (k--) {
    string tmp = "";
    for (int i = 0; i < m; ++i) tmp.push_back('0');
    for (int i = 2; i <= n; ++i) tmp[U[i][V[i]]] = '1';
    ans.emplace_back(tmp);
    bool flag = false;
    for (int i = 2; i <= n; ++i)
      if (++V[i] < U[i].size()) {
        flag = true;
        break;
      } else
        V[i] = 0;
    if (!flag) break;
  }
  cout << ans.size() << '\n';
  for (string i : ans) cout << i << '\n';
  return 0;
}