import std.stdio;
import std.string;
import std.format;
import std.conv;
import std.typecons;
import std.algorithm;
import std.functional;
import std.bigint;
import std.numeric;
import std.array;
import std.math;
import std.range;
import std.container;
import std.concurrency;
import std.traits;
import std.uni;
import std.regex;
import core.bitop : popcnt;
alias Generator = std.concurrency.Generator;

enum long INF = long.max/5;
enum long MOD = 10L^^9+7;

class Vertex {
  long a;
  long value;
  Edge[] edges;
  bool used = false;
  mixin Constructor;
}

struct Edge {
  Vertex begin, end;
  long index;
}

void main() {
  long N, M;
  scanln(N, M);
  struct P {
    long a, b;
  }
  P[] ps = new P[N];
  foreach(i; 0..N) {
    scanln(ps[i].a, ps[i].b);
  }
  ps.sort!"a.a < b.a";

  Vertex[] vs = (N+1).rep!(()=>new Vertex);
  foreach(i; 0..N+1) {
    vs[i].a = i==N ? INF : ps[i].a;
    long x = i==0 ? 0 : ps[i-1].b;
    long y = i==N ? 0 : ps[i].b;
    vs[i].value = x^y;
  }

  long f(long t) {
    long l = 0;
    long r = N+1;
    while(r - l > 1) {
      long c = (l + r)/2;
      if (vs[c-1].a <= t) {
        l = c;
      } else {
        r = c;
      }
    }
    return l;
  }
  foreach(i; 0..M) {
    long l, r;
    scanln(l, r);

    long x = f(l-1);
    long y = f(r);
    vs[x].edges ~= Edge(vs[x], vs[y], i);
    vs[y].edges ~= Edge(vs[y], vs[x], i);
  }

  bool ok = true;
  bool[] xs = new bool[M];

  long dfs(Vertex v, long edgeIndex = -1) {
    v.used = true;
    long value = v.value;
    foreach(e; v.edges) {
      Vertex u = e.end;
      if (u.used) continue;
      value ^= dfs(u, e.index);
    }
    if (value) {
      if (edgeIndex < 0) {
        ok = false;
      } else {
        xs[edgeIndex] = true;
      }
    }
    return value;
  }

  foreach(v; vs) {
    if (v.used) continue;
    dfs(v);
  }

  if (ok) {
    xs.count!"a".writeln;
    xs.enumerate.filter!"a.value".map!"a.index".map!"a+1".map!(to!string).join(" ").writeln;
  } else {
    writeln(-1);
  }
}

// ----------------------------------------------


void times(alias fun)(long n) {
  // n.iota.each!(i => fun());
  foreach(i; 0..n) fun();
}
auto rep(alias fun, T = typeof(fun()))(long n) {
  // return n.iota.map!(i => fun()).array;
  T[] res = new T[n];
  foreach(ref e; res) e = fun();
  return res;
}

T ceil(T)(T x, T y) if (isIntegral!T || is(T == BigInt)) {
  // `(x+y-1)/y` will only work for positive numbers ...
  T t = x / y;
  if (y > 0 && t * y < x) t++;
  if (y < 0 && t * y > x) t++;
  return t;
}

T floor(T)(T x, T y) if (isIntegral!T || is(T == BigInt)) {
  T t = x / y;
  if (y > 0 && t * y > x) t--;
  if (y < 0 && t * y < x) t--;
  return t;
}

ref T ch(alias fun, T, S...)(ref T lhs, S rhs) {
  return lhs = fun(lhs, rhs);
}
unittest {
  long x = 1000;
  x.ch!min(2000);
  assert(x == 1000);
  x.ch!min(3, 2, 1);
  assert(x == 1);
  x.ch!max(100).ch!min(1000); // clamp
  assert(x == 100);
  x.ch!max(0).ch!min(10); // clamp
  assert(x == 10);
}

mixin template Constructor() {
  import std.traits : FieldNameTuple;
  this(Args...)(Args args) {
    // static foreach(i, v; args) {
    foreach(i, v; args) {
      mixin("this." ~ FieldNameTuple!(typeof(this))[i]) = v;
    }
  }
}

void scanln(Args...)(auto ref Args args) {
  enum sep = " ";
  enum n = Args.length;
  enum fmt = n.rep!(()=>"%s").join(sep);

  string line = readln.chomp;
  static if (__VERSION__ >= 2074) {
    line.formattedRead!fmt(args);
  } else {
    enum argsTemp = n.iota.map!(
      i => "&args[%d]".format(i)
    ).join(", ");
    mixin(
      "line.formattedRead(fmt, " ~ argsTemp ~ ");"
    );
  }
}

// fold was added in D 2.071.0
static if (__VERSION__ < 2071) {
  template fold(fun...) if (fun.length >= 1) {
    auto fold(R, S...)(R r, S seed) {
      static if (S.length < 2) {
        return reduce!fun(seed, r);
      } else {
        return reduce!fun(tuple(seed), r);
      }
    }
  }
}

// popcnt with ulongs was added in D 2.071.0
static if (__VERSION__ < 2071) {
  ulong popcnt(ulong x) {
    x = (x & 0x5555555555555555L) + (x>> 1 & 0x5555555555555555L);
    x = (x & 0x3333333333333333L) + (x>> 2 & 0x3333333333333333L);
    x = (x & 0x0f0f0f0f0f0f0f0fL) + (x>> 4 & 0x0f0f0f0f0f0f0f0fL);
    x = (x & 0x00ff00ff00ff00ffL) + (x>> 8 & 0x00ff00ff00ff00ffL);
    x = (x & 0x0000ffff0000ffffL) + (x>>16 & 0x0000ffff0000ffffL);
    x = (x & 0x00000000ffffffffL) + (x>>32 & 0x00000000ffffffffL);
    return x;
  }
}
