#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
 
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
 
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;
 
constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;
 
template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

int main() {
	int N,M; cin >> N >> M;
	vector<int> A,B;
	set<pair<int,int>> st;
	st.insert({0,0}); st.insert({1000000001,0});
	for(int i = 0; i < N; ++i) {
		int a,b; cin >> a >> b;
		st.insert({a,b});
	}
	for(auto& e:st){
		A.push_back(e.first);
		B.push_back(e.second);
	}
	vector<int> dp(N+1);
	for(int i = 0; i < N+1; ++i) dp[i] = (B[i]!=B[i+1]);
	map<pair<int,int>,int> mp;
	vector<vector<int>> edge(N+1);
	for(int i = 0; i < M; ++i) {
		int L,R; cin >> L >> R;
		int l = (lower_bound(ALL(A),L)-A.begin()) - 1;
		int r = (upper_bound(ALL(A),R)-A.begin()) - 1;
		mp[{l,r}]=mp[{r,l}]=i+1;
		edge[l].push_back(r);
		edge[r].push_back(l);
	}
	vector<int> dpt(N+1,0);
	for(int i = 0; i < N+1; ++i) {
		if(dpt[i]) continue;
		queue<int> q;
		q.push(i);
		dpt[i]=1;
		while (q.size()){
			int from = q.front();
			q.pop();
			for(int to:edge[from]){
				if(dpt[to]) continue;
				q.push(to);
				dpt[to]=dpt[from]+1;
			}
		}
	}
	vector<int> ord(N+1);
	iota(ALL(ord),0);
	sort(ALL(ord),[&](int l,int r){return dpt[l]>dpt[r];});
	vector<int> ans;
	for(int pa:ord){
		for(int ch:edge[pa]){
			if(dpt[ch]<=dpt[pa]) continue;
			if(dp[ch]&1) ans.push_back(mp[{pa,ch}]);
			(dp[pa]+=dp[ch])%=2;
			dp[ch] = 0;
		}
	}
	corner(accumulate(ALL(dp),0),-1);
	sort(ALL(ans));
	cout << ans.size() << endl;
	for(int e:ans) cout << e << " ";
	cout << endl;
    return 0;
}

Measured memory_bytes: 39540