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.*;
import java.util.*;

public class Atcoder {
    public static int dirs[][] = {{-1,0},{1,0},{0,1},{0,-1}};
    public static void main(String [] args) throws IOException {

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        
        int test = Integer.parseInt(br.readLine());
       
        while(test-->0) {
            String temp[] = br.readLine().split(" ");
            int n = Integer.parseInt(temp[0]);
            int x = Integer.parseInt(temp[1]);
            int m = Integer.parseInt(temp[2]);
            int array[][] = new int[m][2];
            boolean flag = false;
            int left = -1;
            int right = -1;
            int start = 0;
            for(int i=0;i<m;i++) {
                temp = br.readLine().split(" ");
                int a = Integer.parseInt(temp[0]);
                int b = Integer.parseInt(temp[1]);
                array[i][0] = a;
                array[i][1] = b;
                if(!flag&&x>=a&&x<=b) {
                    start = i;
                    left = a;
                    right = b;
                    flag = true;
                }
            }
            int i=start;
            if(left==-1) {System.out.println(1); continue;}
            while(i<m) {
                if(x>=array[i][0]&&x<=array[i][1]) {
                    left = Math.min(left,array[i][0]);
                    right = Math.max(right,array[i][1]);
                }
                else {
                    if(array[i][1]<left||array[i][0]>right) {}
                    else  {
                   left = Math.min(left,array[i][0]);
                    right = Math.max(right,array[i][1]);
                }
            }
               i++;
            }

            System.out.println(Math.max(1,right-left+1));
       
        }
    }
}

/**
 *  String temp[] = br.readLine().split(" ");
        int a = Integer.parseInt(temp[0]);
        int b = Integer.parseInt(temp[1]);
        if(a==0||b==0){ System.out.println(0); continue;}

        if(b<a) {
            int tt = b;
            b = a;
            a = tt;
        }
        
        if(a*2<=b) System.out.println(a);
        else {
            System.out.println(b/2);
        }
     
 */