#include <bits/stdc++.h>
#define CIOS ios::sync_with_stdio(false);
#define rep(i, a, b) for(register int i = a; i <= b; i++)
#define per(i, a, b) for(register int i = a; i >= b; i--)
#define DEBUG(x) cerr << "DEBUG" << x << " >>> ";
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
template <typename T>
inline void read(T &f) {
    f = 0; T fu = 1; char c = getchar();
    while (c < '0' || c > '9') { if (c == '-') fu = -1; c = getchar(); }
    while (c >= '0' && c <= '9') { f = (f << 3) + (f << 1) + (c & 15); c = getchar(); }
    f *= fu;
}
template <typename T>
void print(T x) {
    if (x < 0) putchar('-'), x = -x;
    if (x < 10) putchar(x + 48);
    else print(x / 10), putchar(x % 10 + 48);
}
template <typename T>
void print(T x, char t) {
    print(x); putchar(t);
}
const int N = 1005, INF = 0x7f7f7f7f;
queue <int> q;
bitset <N> f[N][N], Ans;
vector <int> adj[N];
int dis[N][N], n, m, Q, now;
int main() {
    memset(dis, 0x7f, sizeof(dis));
    read(n); read(m); read(Q);
    for(register int i = 1; i <= m; i++) {
        int a, b; read(a); read(b);
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    for(register int i = 1; i <= n; i++) {
        q.push(i); dis[i][i] = 0; now = i; f[i][0].set(i);
        while(!q.empty()) {
            int u = q.front(); q.pop();
            for(register int j = 0; j < adj[u].size(); j++) {
                int v = adj[u][j];
                if(dis[i][v] == INF) {
                    dis[i][v] = dis[i][u] + 1;
                    q.push(v); f[i][dis[i][v]].set(v);
                }
            }
        }
        for(register int j = 1; j <= n; j++) f[i][j] |= f[i][j - 1];
    }
    while(Q--) {
        int t; read(t); Ans.reset();
        while(t--) {
            int a, b; read(a); read(b);
            if(b > n) b = n;
            Ans |= f[a][b];
        }
        print(Ans.count(), '\n');
    }
    return 0;
}