Problem: Berland is a tourist country! At least, it can become such — the government of Berland is confident about this. 

There are n cities in Berland, some pairs of which are connected by two-ways roads. Each road connects two different cities. In Berland there are no roads which connect the same pair of cities. It is possible to get from any city to any other city using given two-ways roads. 

According to the reform each road will become one-way. It will be oriented to one of two directions.

To maximize the tourist attraction of Berland, after the reform for each city i the value ri will be calculated. It will equal to the number of cities x for which there is an oriented path from the city i to the city x. In other words, ri will equal the number of cities which can be reached from the city i by roads. 

The government is sure that tourist's attention will be focused on the minimum value of ri.

Help the government of Berland make the reform to maximize the minimum of ri.

Input

The first line contains two integers n, m (2 ≤ n ≤ 400 000, 1 ≤ m ≤ 400 000) — the number of cities and the number of roads. 

The next m lines describe roads in Berland: the j-th of them contains two integers uj and vj (1 ≤ uj, vj ≤ n, uj ≠ vj), where uj and vj are the numbers of cities which are connected by the j-th road.

The cities are numbered from 1 to n. It is guaranteed that it is possible to get from any city to any other by following two-ways roads. In Berland there are no roads which connect the same pair of cities. 

Output

In the first line print single integer — the maximum possible value min1 ≤ i ≤ n{ri} after the orientation of roads. 

The next m lines must contain the description of roads after the orientation: the j-th of them must contain two integers uj, vj, it means that the j-th road will be directed from the city uj to the city vj. Print roads in the same order as they are given in the input data. 

Example

Input

7 9
4 3
2 6
7 1
4 1
7 3
3 5
7 4
6 5
2 5


Output

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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
struct node {
  int u, v, next;
  bool is;
} edge[400005 << 1];
int head[400005], cnt;
int n, m;
int dfs_clock, low[400005], pre[400005];
int ans[400005][2];
void add_edge(int u, int v) {
  edge[cnt].is = 0;
  edge[cnt].u = u, edge[cnt].v = v, edge[cnt].next = head[u], head[u] = cnt++;
}
void find_cut(int u, int father) {
  pre[u] = low[u] = ++dfs_clock;
  for (int i = head[u]; i + 1; i = edge[i].next) {
    int v = edge[i].v;
    if (v == father) continue;
    if (!pre[v]) {
      find_cut(v, u);
      if (low[v] <= pre[u]) {
      } else {
        edge[i].is = edge[i ^ 1].is = 1;
      }
      low[u] = min(low[u], low[v]);
    } else {
      low[u] = min(low[u], pre[v]);
    }
  }
}
int cc;
void dfs(int u, int father) {
  cc++;
  pre[u] = 1;
  for (int i = head[u]; i + 1; i = edge[i].next) {
    int v = edge[i].v;
    if (edge[i].is) continue;
    ans[i >> 1][0] = u, ans[i >> 1][1] = v;
    if (!pre[v]) dfs(v, u);
  }
}
void bfs(int s) {
  queue<int> gg;
  while (!gg.empty()) gg.pop();
  memset(pre, 0, sizeof pre);
  gg.push(s);
  pre[s] = 1;
  while (!gg.empty()) {
    int u = gg.front();
    gg.pop();
    for (int i = head[u]; i + 1; i = edge[i].next) {
      int v = edge[i].v;
      if (pre[v]) continue;
      if (edge[i].is) {
        ans[i >> 1][0] = v, ans[i >> 1][1] = u;
      }
      gg.push(v);
      pre[v] = 1;
    }
  }
}
void solve() {
  memset(pre, 0, sizeof pre);
  int Max = 0, from;
  for (int i = 1; i <= n; i++)
    if (!pre[i]) {
      cc = 0;
      dfs(i, 0);
      if (cc > Max) {
        Max = cc, from = i;
      }
    }
  bfs(from);
  cout << Max << endl;
  for (int i = 0; i < m; i++) {
    cout << ans[i][0] << " " << ans[i][1] << endl;
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin >> n >> m;
  memset(head, -1, sizeof head);
  cnt = 0;
  for (int i = 0; i < m; i++) {
    int u, v;
    cin >> u >> v;
    add_edge(u, v);
    add_edge(v, u);
  }
  dfs_clock = 0;
  find_cut(1, 0);
  solve();
  return 0;
}