#include <iostream>
#include <set>
#include <vector>
using namespace std;
int n, m, q;
int kab_sz = 0;
pair<int, int> kab[100000];
int parent[1001];
int sz[1001];
int myset[501];
void make_set (int v) {
	parent[v] = v;
	sz[v] = 1;
}

int find_set (int v) {
	if (v == parent[v])
		return v;
	return parent[v] = find_set (parent[v]);
}

void union_sets (int a, int b) {
	a = find_set (a);
	b = find_set (b);
	if (a != b) {
		if (sz[a] < sz[b])
			swap (a, b);
		parent[b] = a;
		sz[a] += sz[b];
	}
}
void rebuild (int a, int b) {
	for (int i = 0; i < n; i++) {
		parent[i] = i;
		sz[i] = 1;
	}
	for (int i = 0; i < kab_sz; i++) {
		if (a <= i && i <= b) {
			continue;
		} else {
			union_sets(kab[i].first, kab[i].second);
		}
	}
}
int main () {
	scanf ("%d%d", &n, &m);
	for (int i = 0; i < m; i++) {
		int t1, t2;
		scanf ("%d%d", &t1, &t2);
		t1--, t2--;
		kab[kab_sz++] = make_pair(t1, t2);
	}
	scanf ("%d", &q);
	for (int i = 0; i < q; i++) {
		int t1, t2;
		set<int> ans;
		scanf ("%d%d", &t1, &t2);
		t1--, t2--;
		rebuild(t1, t2);
		for (int j = 0; j < n; j++) {
			myset[find_set(j)]++;
		}
		int cc = 0;
		for (int j = 0; j < n; j++) {
			if (myset[j]) {
				cc++;
				myset[j] = 0;
			}
		}
		printf("%d\n", cc);
	}
	return 0;
}