#include<cstdio>
#include<vector>
#define x first
#define y second
const int N = 100005;
using namespace std;
int n, m, v[N], nr, term[N];
vector<int> a[N];
pair<int, int> sol[2 * N];
void dfs(int k) {
	int i;
	v[k] = 1;
	for(i = 0 ;i < a[k].size(); ++i)
		if(!v[a[k][i]]) {
			sol[++nr].x = k;	sol[nr].y = a[k][i];
			dfs(a[k][i]);
		}
}

void DFS(int k) {
	int i;
	v[k] = 0;
	for(i = 0; i < a[k].size(); ++i)
		if(v[a[k][i]]) {
			DFS(a[k][i]);
			sol[++nr].x = a[k][i];	sol[nr].y = k;
		}
}
int main() {
	freopen("mesaj4.in", "r", stdin);
	freopen("mesaj4.out", "w", stdout);
	scanf("%d %d", &n, &m);
	int i, X, Y;
	for(i = 1; i <= m; ++i)
		scanf("%d %d", &X, &Y),	a[X].push_back(Y),	a[Y].push_back(X);
	dfs(1);
	int sw = 1;
	
	for(i = 1; i < n; ++i)
		if(v[i] == 0) {
			sw = 0;
			break;
		}
	
	if(!sw) 
		printf("-1\n");
	else {
		DFS(1);
		printf("%d\n", 2 * (n - 1));
		for(i = 1;i <= nr; ++i)
			printf("%d %d\n", sol[i].x, sol[i].y);
	}

	return 0;
}