#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
//1142
const int maxn = 210;
int n, m, k, p, mmax, clique,mmin,sum;
int G[maxn][maxn],node[maxn];
int main() {
memset(G, 0, sizeof(G));
cin >> n >> m;
int a, b;
for (int i = 0; i < m; i++) {
cin >> a >> b;
G[a] = 1;
G[a] = 1;
}
cin >> k;
for (int i = 0; i < k; i++) {
memset(node, 0, sizeof(node));
mmax = 1, clique = 1;
mmin = 999;
cin >> p;
for (int i = 0; i < p; i++) {
cin >> node;
}
天盟APP下载
