#include <iostream>
#include <fstream>
#include <bitset>
#include <queue>

#define pii pair<int, int>

using namespace std;

ifstream fin("mesaj4.in");
ofstream fout("mesaj4.out");

const int N = 1e6 + 1;
vector <int> adj[N];
bitset <N> viz;
vector <pii> rasp;

void dfs(int nod, int prov) {
	viz[nod] = 1;
	for (auto vec : adj[nod]) {
		if (!viz[vec]) {
			rasp.push_back({ vec, nod });
			dfs(vec, nod);
		}
	}
}

int main() {
	int n, m;
	fin >> n >> m;
	for (int i = 1; i <= m; i++) {
		int a, b;
		fin >> a >> b;
		adj[a].push_back(b);
		adj[b].push_back(a);
	}
	dfs(1, 0);
	if (rasp.size() == n - 1) {
		fout << rasp.size() * 2 << "\n";
		for (int i = 0; i < rasp.size(); i++)
			fout << rasp[rasp.size() - i - 1].first << " " << rasp[rasp.size() - i - 1].second << "\n";
		for (int i = 0; i < rasp.size(); i++)
			fout << rasp[i].second << " " << rasp[i].first << "\n";
	} else fout << -1;
	return 0;
}