#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
const long long mod = 998244353;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-7;
long long GCD(long long a, long long b) {
  while (b ^= a ^= b ^= a %= b)
    ;
  return a;
}
long long LCM(long long a, long long b) { return a * b / GCD(a, b); }
long long prime[maxn] = {0}, num_prime = 0;
int isNotPrime[maxn] = {1, 1};
inline long long read() {
  long long X = 0, w = 0;
  char ch = 0;
  while (!isdigit(ch)) {
    w |= ch == '-';
    ch = getchar();
  }
  while (isdigit(ch)) X = (X << 3) + (X << 1) + (ch ^ 48), ch = getchar();
  return w ? -X : X;
}
inline void write(int x) {
  if (x < 0) putchar('-'), x = -x;
  if (x > 9) write(x / 10);
  putchar(x % 10 + '0');
}
void isPrime() {
  for (int i = 2; i < maxn; ++i) {
    if (!isNotPrime[i]) prime[num_prime++] = i;
    for (int j = 0; j < num_prime && i * prime[j] < maxn; ++j) {
      isNotPrime[i * prime[j]] = 1;
      if (!i % prime[j]) break;
    }
  }
  printf("%lld", prime[num_prime - 1]);
}
long long binaryPow(long long a, long long b, long long c) {
  long long ans = 1;
  while (b > 0) {
    if (b & 1) {
      ans = ans * a % c;
    }
    a = a * a % c;
    b >>= 1;
  }
  return ans % c;
}
void BUG() { printf("DEBUG\n"); }
struct node {
  int val;
  int vis;
  int u, v;
  int num;
} g[maxn];
int use[maxn];
int cmp1(const node& a, const node& b) { return a.num < b.num; }
int cmp(const node& a, const node& b) {
  if (a.val == b.val) return a.vis > b.vis;
  return a.val < b.val;
}
int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; ++i) use[i] = i + 1;
  for (int i = 1; i <= m; ++i) {
    scanf("%d %d", &g[i].val, &g[i].vis);
    g[i].num = i;
  }
  sort(g + 1, g + 1 + m, cmp);
  int cnt = 1;
  int flag = 1;
  for (int i = 1; i <= m; ++i) {
    if (g[i].vis == 1) {
      g[i].u = 1;
      g[i].v = ++cnt;
    } else {
      int flag1 = 0;
      for (int j = 2; j <= cnt; ++j) {
        if (use[j] <= cnt) {
          g[i].u = j;
          g[i].v = use[j];
          use[j]++;
          flag1 = 1;
          break;
        }
      }
      if (!flag1) {
        flag = 0;
        break;
      }
    }
  }
  if (!flag)
    printf("-1\n");
  else {
    sort(g + 1, g + 1 + m, cmp1);
    for (int i = 1; i <= m; ++i) {
      printf("%d %d\n", g[i].u, g[i].v);
    }
  }
}
