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 JAVA):

Solution:
import java.io.*;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;

public class F732 {

    static BufferedReader in;
    static PrintWriter out;
    static StringTokenizer tok;

    public static void main(String[] args) throws IOException {
        try {
            in = new BufferedReader(new FileReader("strings1.in"));
            out = new PrintWriter(new File("strings1.out"));
        } catch (Exception e) {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(new OutputStreamWriter(System.out));
        }
        tok = new StringTokenizer("");
        new F732().solve();
        out.flush();
        out.close();
    }

    String nextTok() throws IOException {
        while (!tok.hasMoreTokens()) {
            tok = new StringTokenizer(in.readLine());
        }
        return tok.nextToken();
    }

    int nextInt() throws IOException {
        return Integer.parseInt(nextTok());
    }

    long nextLong() throws IOException {
        return Long.parseLong(nextTok());
    }

    double nextDouble() throws IOException {
        return Double.parseDouble(nextTok());
    }

    static class Edge implements Comparable<Edge>  {

        int from;
        int to;
        int ind;
        boolean rev;

        Edge (int from, int to, int ind, boolean rev) {
            this.from = from;
            this.to = to;
            this.ind = ind;
            this.rev = rev;
        }

        @Override
        public int compareTo(Edge o) {
            if (from < o.from) return -1;
            if (from > o.from) return 1;
            if (to < o.to) return -1;
            if (to > o.to) return 1;
            return 0;
        }
    }

    int n;
    int timer = 1;
    boolean[] used;
    int[] direction;
    boolean[] bridge;
    int[] inT;
    int[] minIn;
    ArrayList<Edge>[] g;
    ArrayList<Edge> inp = new ArrayList<>();


    void bridges_dfs(int v, int p) {
        used[v] = true;
        inT[v] = timer;
        minIn[v] = timer;
        timer++;
        Edge t;
        for (int i = 0; i < g[v].size(); i++) {
            t = g[v].get(i);
            if (t.to == p) continue;
            if (used[t.to]) {
                minIn[v] = Math.min(minIn[v],minIn[t.to]);
            } else {
                bridges_dfs(t.to,v);
                minIn[v] = Math.min(minIn[v],minIn[t.to]);
                if (minIn[t.to] > inT[v]) {
                    bridge[t.ind] = true;
                }
            }
        }
    }

    int maxComponent_dfs(int v) {
        int cnt = 1;
        used[v] = true;
        Edge t;
        for (int i = 0; i < g[v].size(); i++) {
            t = g[v].get(i);
            if (!bridge[t.ind] && !used[t.to]) {
                cnt += maxComponent_dfs(t.to);
            }
        }
        return cnt;
    }

    //1 - rev; 0 - stright;
    void makeDirection_dfs(int v) {
        used[v] = true;
        Edge t;
        for (int i = 0; i < g[v].size(); i++) {
            t = g[v].get(i);
            if (!used[t.to]) {
                if (bridge[t.ind]) {
                    if (t.rev) {
                        direction[t.ind] = 0;
                    } else direction[t.ind] = 1;
                } else {
                    if (t.rev) {
                        direction[t.ind] = 1;
                    } else direction[t.ind] = 0;
                }
                makeDirection_dfs(t.to);
            } else {
                if (!bridge[t.ind]) {
                    if (t.rev) {
                        direction[t.ind] = 1;
                    } else direction[t.ind] = 0;
                }
            }
        }
    }


    void solve() throws IOException {
        n = nextInt();
        int m = nextInt();
        used = new boolean[n+1];
        g = new ArrayList[n+1];
        direction = new int[m];
        inT = new int[n+1];
        minIn = new int[n+1];
        bridge = new boolean[m];


        for (int i = 0; i <= n; i++) {
            g[i] = new ArrayList<>();
        }

        Edge t;
        Edge rev;
        for (int i = 0; i < m; i++) {
            t = new Edge(nextInt(),nextInt(),i,false);
            inp.add(t);
            rev = new Edge(t.to,t.from,i,true);
            g[t.from].add(t);
            g[rev.from].add(rev);
        }

        bridges_dfs(1,-1);
        Arrays.fill(used,false);
        int max = -1;
        int start = -1;
        for (int i = 1; i <= n; i++) {
            if (!used[i]) {
                int tmp = maxComponent_dfs(i);
                if (tmp > max) {
                    max = tmp;
                    start = i;
                }
            }
        }
        out.println(max);
        Arrays.fill(used,false);
        makeDirection_dfs(start);

        for (int i = 0; i < inp.size(); i++) {
            t = inp.get(i);
            if (direction[i] == 0) {
                out.println(t.from+" "+t.to);
            } else out.println(t.to+" "+t.from);
        }
//        for (int i = 0; i < n+1; i++) {
//            if (bridge[i] == true) {
//                out.println(i+" - bridge");
//            }
//        }

    }

    private BigInteger catalan (int i) {
        return factorial(2 * i).divide((factorial(i + 1).multiply(factorial(i))));
    }

    private BigInteger factorial (int i) {
        BigInteger n = BigInteger.valueOf(i);
        if (i == 0) {
            return new BigInteger("1");
        }
        while (--i > 0) {
            n = n.multiply(BigInteger.valueOf(i));
        }
        return n;
    }
}