B'You are given a connected undirected graph with n vertices and m edges. Vertices of the graph are numbered by integers from 1 to n and edges of the graph are numbered by integers from 1 to m . Your task is to answer q queries, each consisting of two integers l and r . The answer to each query is the smallest non-negative integer k such that the following condition holds: The first line contains a single integer t ( 1 <= t <= 1000 ) -- the number of test cases. The first line of each test case contains three integers n , m , and q ( 2 <= n <= 10^5 , 1 <= m, q <= 2 cdot 10^5 ) -- the number of vertices, edges, and queries respectively. Each of the next m lines contains two integers u_i and v_i ( 1 <= u_i, v_i <= n ) -- ends of the i -th edge. It is guaranteed that the graph is connected and there are no multiple edges or self-loops. Each of the next q lines contains two integers l and r ( 1 <= l <= r <= n ) -- descriptions of the queries. It is guaranteed that that the sum of n over all test cases does not exceed 10^5 , the sum of m over all test cases does not exceed 2 cdot 10^5 , and the sum of q over all test cases does not exceed 2 cdot 10^5 . For each test case, print q integers -- the answers to the queries. In the first test case, the graph contains 2 vertices and a single edge connecting vertices 1 and 2 . In the first query, l=1 and r=1 . It is possible to reach any vertex from itself, so the answer to this query is 0 . In the second query, l=1 and r=2 . Vertices 1 and 2 are reachable from one another using only the first edge, through the path 1 longleftrightarrow 2 . It is impossible to reach vertex 2 from vertex 1 using only the first 0 edges. So, the answer to this query is 1'...