Time Limit: 1000 MS Memory Limit: 65536 K

## Description

zxhy2 likes travelling.One day he comes to a contry call Kingdom of Heaven.
In this contry there are N cities numbered from 1 to N and there are M bidirectional freeways between the cities.
zxhy2 wonders whether he can go from city x to city y through these freeways.Can you help him?
## Input

The first line of input is the number of test case.
For each test case,The first line contains two integers, N(1<=N<=10000),M(1<=100000), Q(1<=Q<=10000).
Then M lines followed, each line cotains two integers x, y(1<=x,y<=N),
means that there is a freeway between city x and city y.
Then Q lines followed, each line cotains two integers x, y(1<=x,y<=N),
means a query that zxhy2 wonder whether zxhy2 can go from city x to city y through freeways.
## Output

Each query contains One line.
If zxhy2 can go from x to city y through freeways successfully, print "Yes", otherwise print"No".
## Sample Input

1
5 3 5
1 2
2 3
4 5
1 3
3 1
4 5
5 4
1 5
## Sample Output

Yes
Yes
Yes
Yes
No

## Source

SCU 2009 warmup contest 1 ( Happy Birthday to zxhy2 ! )