1149 Dangerous Goods Packaging (25 分)

#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define ull unsigned long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define piii pair<int,pii>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)

#define base 2333
const int mod=1e9+7;
const int maxn=1e5;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int n,m;
map<int,int> mp;
int a1[maxn],a2[maxn];
int main(){
    ios::sync_with_stdio(false);
    cin>>n>>m;
    rep(i,0,n) cin>>a1[i]>>a2[i];
    rep(i,0,m){
        int k,x,flg=1;
        cin>>k;
        mp.clear();
        rep(j,0,k){
            cin>>x;
            mp[x]=1;
        }
        rep(j,0,n){
            if(mp[a1[j]]&&mp[a2[j]]){
                flg=0;
                break;
            }
        }
        if(flg) cout<<"Yes\n";
        else cout<<"No\n";
    }
    return 0;
}