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.io.BufferedReader; 
import java.io.IOException; 
import java.io.InputStreamReader; 
import java.util.StringTokenizer; 
import java.util.*;
 
public class Solution 
{ 
    
    public static int gcd(int a,int b){
        if(a==1 ||b==1)
        return 1;
        if(b==0)
        return a;
        return gcd(b, a%b);
    }
      public static String ans(char [][]arr,int n,int m,int g){
           for(int i=0;i<n;i++){
                for(int j=0;j<m;j++){
                    if(arr[i][j]=='B'){
                        if(g>0 && i==n-2 && j==m-1)
                        return "No";
                          if(g>0 && i==n-1 && j==m-2)
                        return "No";
                        if(i>0 && arr[i-1][j]=='G')
                        return "No";
                          if(j>0 && arr[i][j-1]=='G')
                        return "No";
                          if(i<n-1 && arr[i+1][j]=='G')
                        return "No";
                          if(j<m-1 && arr[i][j+1]=='G')
                        return "No";
                    }
                }}
                return "Yes";
      }
    public static void main(String[] args) throws IOException 
    { 
  
       BufferedReader br = new BufferedReader( 
                             new InputStreamReader(System.in));
        StringBuilder out=new StringBuilder(); 
     
        StringTokenizer  st=new StringTokenizer(br.readLine());
           int t=Integer.parseInt(st.nextToken());
		while(t-->0){
 		 
		  st=new StringTokenizer(br.readLine());
		    int n=Integer.parseInt(st.nextToken());
           int x=Integer.parseInt(st.nextToken());
           int m=Integer.parseInt(st.nextToken());
           int mini=x,maxi=x;
         for(int i=0;i<m;i++){
               st=new StringTokenizer(br.readLine());
		    int l=Integer.parseInt(st.nextToken());
           int r=Integer.parseInt(st.nextToken());
           if(r<mini || l>maxi)
           continue;
           else{
               mini=Math.min(mini,l);
               maxi=Math.max(maxi,r);
           }
         }
         out.append((maxi-mini+1)+"\n");
	}
	
		System.out.println(out);
                
}}

// class Graph 
// { 
//     private int V;   // No. of vertices 
  
//     // Array  of lists for Adjacency List Representation 
//      ArrayList<pair> adj[]; 
  
//     // Constructor 
//     Graph(int v) 
//     { 
//         V = v; 
//         adj = new ArrayList[v]; 
//         for (int i=0; i<v; ++i) 
//             adj[i] = new ArrayList(); 
//     } 
  
//     //Function to add an edge into the graph 
//     void addEdge(int v, int w,int x) 
//     { 
//         adj[v].add(new pair(w,x));
//         adj[w].add(new pair(v,x));// Add w to v's list. 
//     } 
  
//     // A function used by DFS 
// }
class pair{
    int v;
    int wgt;
    public pair(int x,int y){
        v=x;
        wgt=y;
        
    }
}