Description:

As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:

There is an undirected graph with n vertices and m edges. Then Yuta does q operations on this graph. Each operation is described by two integers L,R (1≤L≤R≤n) and can be split into three steps:

1. Delete all the edges which have at least one vertice outside the range [L,R].

2. Yuta wants you to tell him the number of connected component of the graph.

3. Restore the graph.

This task is too hard for Rikka to solve. Can you help her?

Input:

There are at most 100 testcases and there are at least 97 testcases with n,m,q≤1000.

For each testcase, the first line contains three numbers n,m,q (n,q≤10^{5},m≤2×10^{5}).

Then m lines follow. Each line contains two numbers ui,vi (1≤ui,vi≤10^{5)} which describe an edge of the graph.

Then q lines follows. Each line contains two numbers Li,Ri (1≤L≤R≤n) which describe an operation.

Output:

For each operation you need print a single line with a single number - the answer of this operation.

Sample Input:

3 3 2 1 2 1 3 2 3 1 2 1 3

Sample Output:

2 1

Source:

Submit