You are given an array consisting of n integers a_1, a_2, ..., a_n. Initially a_x = 1, all other elements are equal to 0.

You have to perform m operations. During the i-th operation, you choose two indices c and d such that l_i ≤ c, d ≤ r_i, and swap a_c and a_d.

Calculate the number of indices k such that it is possible to choose the operations so that a_k = 1 in the end.

Input

The first line contains a single integer t (1 ≤ t ≤ 100) — the number of test cases. Then the description of t testcases follow.

The first line of each test case contains three integers n, x and m (1 ≤ n ≤ 10^9; 1 ≤ m ≤ 100; 1 ≤ x ≤ n).

Each of next m lines contains the descriptions of the operations; the i-th line contains two integers l_i and r_i (1 ≤ l_i ≤ r_i ≤ n).

Output

For each test case print one integer — the number of indices k such that it is possible to choose the operations so that a_k = 1 in the end.

Example

Input


3
6 4 3
1 6
2 3
5 5
4 1 2
2 4
1 2
3 3 2
2 3
1 2


Output


6
2
3

Note

In the first test case, it is possible to achieve a_k = 1 for every k. To do so, you may use the following operations:

  1. swap a_k and a_4; 
  2. swap a_2 and a_2; 
  3. swap a_5 and a_5. 



In the second test case, only k = 1 and k = 2 are possible answers. To achieve a_1 = 1, you have to swap a_1 and a_1 during the second operation. To achieve a_2 = 1, you have to swap a_1 and a_2 during the second operation.
import java.util.*;
import java.io.*;
 
public class Solution{
	static PrintWriter out=new PrintWriter(System.out);
	public static void main (String[] args) throws IOException{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		
		String[] input=br.readLine().trim().split(" ");
		int numTestCases=Integer.parseInt(input[0]);
		while(numTestCases-->0) {
		    input=br.readLine().trim().split(" ");
			int n=Integer.parseInt(input[0]);
			int x=Integer.parseInt(input[1]);
			int m=Integer.parseInt(input[2]);
			
			
			int start=x,end=x;
			for(int i=0;i<m;i++){
			    input=br.readLine().trim().split(" ");
			    int l=Integer.parseInt(input[0]);
			    int r=Integer.parseInt(input[1]);
			    
			    if(isOverlapping(start,end,l,r)){
			        start=Math.min(start,l);
			        end=Math.max(end,r);
			    }
			}
			out.println(end-start+1);
			
		}
		
		out.flush();
		out.close();
	}
	public static boolean isOverlapping(int start,int end,int l,int r)
	{
	    if(r<start || l>end)
	    {
	        return false;
	    }
	    return true;
	}
}

class Pair implements Comparable<Pair>{
    int start;
    int end;
    
    public Pair(int start,int end)
    {
        this.start=start;
        this.end=end;
    }
    
    public int compareTo(Pair p)
    {
        int startComparison=this.start-p.start;
        if(startComparison!=0){
            return startComparison;
        }
        return this.end-p.end;
    }
}