#include <bits/stdc++.h>
using namespace std;
int BIT(int i, long long x) { return (x & (1 << i)); }
long long ONBIT(int i, long long x) { return (x | (1 << i)); }
long long OFFBIT(int i, long long x) { return (x & ~(1 << i)); }
long long FLIPBIT(int i, long long x) { return (x ^ (1 << i)); }
long long NUMBIT(long long x) { return __builtin_popcount(x); }
template <class T>
T gcd(T a, T b) {
  T r;
  int dem = 0;
  while (b != 0) {
    r = a % b;
    dem++;
    a = b;
    b = r;
  }
  cout << dem << endl;
  return a;
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
const int maxn = 1100;
const int maxe = maxn * maxn;
const int inf = (int)1e9 + 5;
const long long linf = (long long)1e16 + 5;
const int dr[] = {-1, 0, +1, 0};
const int dc[] = {0, +1, 0, -1};
const long double eps = 1e-9;
const char IN[] = "_.in";
const char OUT[] = "_.out";
const int base = 1000000007;
int test;
int nextInt() {
  int x = 0, p = 1;
  char c;
  do {
    c = getchar();
  } while (c <= 32);
  if (c == '-') {
    p = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = x * 10 + c - '0';
    c = getchar();
  }
  return x * p;
}
int n, m, que;
struct canh {
  int x;
  int cs;
};
vector<canh> ke[maxe];
bool tham[maxn];
int l, r;
void dfs(int u) {
  tham[u] = true;
  for (__typeof(ke[u].begin()) i = ke[u].begin(); i != ke[u].end(); i++) {
    int v = (*i).cs;
    if (v < l || v > r) {
      int j = (*i).x;
      if (!tham[j]) dfs(j);
    }
  }
}
int main() {
  n = nextInt();
  m = nextInt();
  for (int i = (1); i <= (m); i++) {
    canh u;
    int x, y;
    cin >> x >> y;
    u.x = y;
    u.cs = i;
    ke[x].push_back(u);
    u.x = x;
    ke[y].push_back(u);
  }
  cin >> que;
  for (int i = (1); i <= (que); i++) {
    l = nextInt();
    r = nextInt();
    memset((tham), (false), sizeof(tham));
    int res = 0;
    for (int i = (1); i <= (n); i++)
      if (!tham[i]) {
        res++;
        dfs(i);
      }
    cout << res << endl;
  }
}
