Problem: The Berland capital (as you very well know) contains n junctions, some pairs of which are connected by two-way roads. Unfortunately, the number of traffic jams in the capital has increased dramatically, that's why it was decided to build several new roads. Every road should connect two junctions. 

The city administration noticed that in the cities of all the developed countries between any two roads one can drive along at least two paths so that the paths don't share any roads (but they may share the same junction). The administration decided to add the minimal number of roads so that this rules was fulfilled in the Berland capital as well. In the city road network should exist no more than one road between every pair of junctions before or after the reform.

Input

The first input line contains a pair of integers n, m (2 ≤ n ≤ 900, 1 ≤ m ≤ 100000), where n is the number of junctions and m is the number of roads. Each of the following m lines contains a description of a road that is given by the numbers of the connected junctions ai, bi (1 ≤ ai, bi ≤ n, ai ≠ bi). The junctions are numbered from 1 to n. It is possible to reach any junction of the city from any other one moving along roads.

Output

On the first line print t — the number of added roads. Then on t lines print the descriptions of the added roads in the format of the input data. You can use any order of printing the roads themselves as well as the junctions linked by every road. If there are several solutions to that problem, print any of them.

If the capital doesn't need the reform, print the single number 0.

If there's no solution, print the single number -1.

Examples

Input

4 3
1 2
2 3
3 4


Output

1
1 4


Input

4 4
1 2
2 3
2 4
3 4


Output

1
1 3

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 900 + 5, M = 1e5 + 5;
vector<int> adj[N], cmp[N], leaf;
vector<pair<int, int>> ed;
int h[N], mn[N], mark[N];
int n, m, from[M], to[M];
bitset<N> edge[N];
void dfs1(int u) {
  mark[mn[u] = u] = 1;
  for (auto e : adj[u]) {
    int v = from[e] ^ to[e] ^ u;
    if (!mark[v]) {
      h[v] = h[u] + 1;
      dfs1(v);
      if (h[mn[v]] < h[mn[u]]) mn[u] = mn[v];
    } else if (h[v] < h[u] - 1 && h[v] < h[mn[u]])
      mn[u] = v;
  }
}
void dfs2(int u) {
  if (mn[u] == u) mark[u] = u;
  cmp[mark[u]].push_back(u);
  for (auto e : adj[u]) {
    int v = from[e] ^ to[e] ^ u;
    if (!mark[v]) {
      mark[v] = mark[u];
      dfs2(v);
    }
  }
}
void dfs3(int u, int p) {
  int d = 0;
  for (auto e : adj[u])
    if (e ^ p) {
      dfs3(from[e] ^ to[e] ^ u, e);
      d++;
    }
  if (!d) leaf.push_back(u);
}
inline void connect(int a, int b) {
  for (auto u : cmp[a])
    for (auto v : cmp[b])
      if (!edge[u][v]) return ed.push_back({u, v});
  cout << "-1\n";
  exit(0);
}
inline void readInput() {
  cin >> n >> m;
  for (int i = 1; i <= m; i++) {
    int u, v;
    cin >> u >> v;
    edge[u][v] = edge[v][u] = true;
    from[i] = u, to[i] = v;
    adj[u].push_back(i);
    adj[v].push_back(i);
  }
}
inline void solve() {
  dfs1(1);
  memset(mark, 0, sizeof mark);
  dfs2(1);
  for (int u = 1; u <= n; u++) adj[u].clear();
  for (int i = 1; i <= m; i++) {
    to[i] = mark[to[i]];
    from[i] = mark[from[i]];
    if (from[i] ^ to[i]) {
      adj[to[i]].push_back(i);
      adj[from[i]].push_back(i);
    }
  }
  for (int u = 1; u <= n; u++) {
    sort(adj[u].begin(), adj[u].end());
    adj[u].resize(unique(adj[u].begin(), adj[u].end()) - adj[u].begin());
  }
}
inline void writeOutput() {
  int root = 1;
  for (int u = 1; u <= n; u++)
    if (adj[u].size() > 1) root = u;
  dfs3(root, 0);
  int k = leaf.size();
  if (k & 1 && cmp[root].size() < n) {
    connect(leaf[k / 2], k > 1 ? leaf[0] : root);
    leaf.erase(leaf.begin() + k / 2);
  }
  for (int i = 0; i < k / 2; i++) connect(leaf[i], leaf[i + k / 2]);
  cout << ed.size() << endl;
  for (auto e : ed) cout << e.first << ' ' << e.second << endl;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  readInput(), solve(), writeOutput();
  return 0;
}