EIU Programming Practices and Exams

You are given an undirected graph that has n vertices and m edges. You are also given q queries, each of them contains two vertices a and b. You should check if there is a path between a and b.

Input

The first line contains 3 integers n, m, q (0 < n, m ≤ 10⁵).

Each of the next m lines contains two integers u, v representing an edge connecting vertex u and vertex v (0 ≤ u, v < n).

Each of the next q lines contains two integers a and b, representing a query (0 ≤ a, b < n).

Output

For each query, print “YES” if there is a path between two vertices, otherwise print “NO”. The output is case-sensitive.

Sample

https://drive.google.com/file/d/1Lu4JPqxvw8etw0d6OWHzeAVsqY0TJyAn/view?usp=sharing