#include using namespace std; #define F first #define S second #define R cin>> #define ln cout<<'\n' #define ll long long #define in(a) insert(a) #define pb(a) push_back(a) #define pd(a) printf("%.10f\n",a) #define mem(a) memset(a,0,sizeof(a)) #define all(c) (c).begin(),(c).end() #define iter(c) __typeof((c).begin()) #define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--) #define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++) #define rep(i,n) REP(i,0,n) #define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++) ll check(ll n,ll m,ll x,ll y){return x>=0&&x=0&&yvoid pr(const A &a,const B&...b){cout<void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")< P; vector v[222222]; int ord[222222], low[222222]; void dfs(int x,int p,int &c,vector

&B){ ord[x]=low[x]=c++; for(int i=0;i &B){ B.clear(); int c=0; fill(ord,ord+n,-1); for(int i=0;i> n >> m >> T; rep(i,m) { ll x,y; cin >> x >> y; x--,y--; v[x].pb(y); v[y].pb(x); } vector

b; bridge(n,b); set

se; rep(i,b.size()) { se.in(b[i]); swap(b[i].F,b[i].S); se.in(b[i]); } init(n); rep(i,b.size()) unite(b[i].F,b[i].S); while(T--) { ll x,y; cin >> x >> y; x--,y--; if(same(x,y)) pr("Yes"); else pr("No"); } } int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}