#ifndef DEBUG
#  define NDEBUG
#endif
#include <iostream>
#include <string>
#include <iterator>
#include <utility>
#include <type_traits>
#include <limits>
#include <cassert>
#include <vector>
#include <set>
#include <tuple>
#include <algorithm>

using namespace std;

// template {{{
// misc {{{
using Z = int;
[[maybe_unused]]
constexpr Z INF = numeric_limits<Z>::max() / 3;
// }}}

// debug {{{
template <class T>
using enable_if_sequence_t = enable_if_t<
  is_same<
    typename iterator_traits<
      typename remove_cv_t<remove_reference_t<T>>::iterator
    >::iterator_category,
    random_access_iterator_tag>{}>;
#ifdef NDEBUG
# define dump(x)
# define debug if (0)
template <class T>
inline T&& ix(T&& value) { return value; }
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix(T&& container, Index index, Indices... indices) {
  return ix(container[index], indices...);
}
#else
# define dump(x) do { \
    cerr << "\e[33m[dump: " << __LINE__ << "] " << (#x) << " = " << x << "\e[0m" << endl; \
  } while (0);
# define debug
template <class T>
inline auto&& ix_impl([[maybe_unused]] int line, [[maybe_unused]] const char* code, T&& value) {
  return value;
}
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix_impl(int line, const char* code, T&& container, Index index, Indices... indices) {
  if (index < 0) {
    cerr << "\e[31mix: negative index at line " << line << ", ix(" << code << ")\e[0m" << endl;
    exit(1);
  }
  int size = container.size();
  if (index >= size) {
    cerr << "\e[31mix: index out of range at line " << line << ", ix(" << code << ")\n"
      << "index = " << index << " whereas size = " << size << "\e[0m" << endl;
    exit(1);
  }
  return ix_impl(line, code, container[index], indices...);
}
#define ix(...) ix_impl(__LINE__, #__VA_ARGS__, __VA_ARGS__)
#endif
// }}}

// IO {{{
template <class T, class U>
ostream& operator<< (ostream& os, pair<T, U> p) {
  os << '(' << p.first << ", " << p.second << ')';
  return os;
}
template <class T>
false_type is_container_impl(...);
template <class T, class = typename T::iterator>
true_type is_container_impl(T);
template <class T>
struct is_container : decltype(is_container_impl<T>(declval<T>())) {};
template <>
struct is_container <string> : std::false_type {};
template <class Container, class = enable_if_t<is_container<Container>{}>>
istream& operator>> (istream& is, Container& cont) {
  for (auto& v : cont) is >> v;
  return is;
}
template <class Container, class = enable_if_t<is_container<Container>{}>>
ostream& operator<< (ostream& os, Container const& cont) {
  bool first = true;
  constexpr char sep =
    is_container<typename Container::value_type>{} ? '\n' : ' ';
  for (auto const& v : cont) {
    if (!first) {
      os << sep;
    }
    first = false;
    os << v;
  }
  return os;
}
// }}}
// }}}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  Z N, M;
  cin >> N >> M;
  vector<set<Z>> graph(N);
  for (auto i = 0; i < M; i++) {
    Z a, b;
    cin >> a >> b;
    a--;
    b--;
    ix(graph, a).insert(b);
    ix(graph, b).insert(a);
  }
  vector<pair<Z, Z>> directed;
  vector<Z> degs(N);
  set<pair<Z, Z>> vertices;
  for (auto i = 0; i < N; i++)
    vertices.emplace(ix(graph, i).size(), i);
  while (!vertices.empty()) {
    dump(vertices);
    Z adj, v;
    tie(adj, v) = *begin(vertices);
    Z to = *begin(ix(graph, v));
    if (ix(degs, v) == 0) {
      directed.emplace_back(to, v);
      ix(degs, to) = 1 - ix(degs, to);
    }
    else {
      directed.emplace_back(v, to);
      ix(degs, v) = 1 - ix(degs, v);
    }
    vertices.erase(begin(vertices));
    if (adj > 1)
      vertices.emplace(adj - 1, v);
    ix(graph, v).erase(to);
    vertices.erase({ix(graph, to).size(), to});
    ix(graph, to).erase(v);
    if (ix(graph, to).size() > 0)
      vertices.emplace(ix(graph, to).size(), to);
  }
  if (any_of(begin(degs), end(degs), [] (auto d) { return d == 1; }))
    cout << -1 << endl;
  else {
    assert(directed.size() == M);
    for (auto&& p : directed)
      cout << p.first + 1 << ' ' << p.second + 1 << '\n';
  }
}



Measured memory_bytes: 21496