PROGRAMMING:Conquest game

Conquest is a desktop game in which several opposing players want to destroy each other's country. The game board is divided into many hypothetical countries. When it's a player's turn, the army of a country can only attack the enemy countries whose borders are connected. After conquering a country, the army can move to the newly conquered country. During the game, players usually have to conquer a series of countries in order to transfer a large number of troops from the starting country to the target country. Usually, players try to minimize the number of countries they want to conquer when they choose the countries they want to conquer. Suppose there are n countries on the game board, numbered 0 to n-1.
Please write a program to calculate at least how many countries need to be conquered to reach the target country for a given starting country and target country. It is not necessary to output the sequence of conquered countries, but only the number of conquered countries. For example, in the country map shown in the figure below, at least 2 countries need to be conquered from the start country 0 to the target country 4.
###Input format:
Enter three integers n, e and m in the first line, all of which are no more than 1000. N is the number of countries. Next, line e represents the border between countries, and each line contains two integers i and j, indicating that country I borders country J. Next, row M represents group M queries, and each row contains two integers x and y, representing the start country and target country numbers.
###Output format:
The output is m lines, that is, the minimum number of countries to conquer for a given X and y.
###Input example:
```in
5 6 2
0 1
0 3
1 2
2 3
1 4
2 4
0 4
1 2
```
###Output example:
```out
two
one
```







answer：If there is no answer, please comment