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.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;

public class Main {

	
	public static void main(String[] args) throws IOException {
		Scanner s = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		String[] input;
		int t = s.nextInt();
		while(t-->0) {
			int n = s.nextInt(), x = s.nextInt(), m = s.nextInt();
			int[][] arr = new int[m][3];
			ArrayList<int[]> list = new ArrayList<int[]>();
			for(int i = 0; i < m; i++) {
				int l = s.nextInt(), r = s.nextInt();
				arr[i][0] = l;
				arr[i][1] = r;
				if(l <= x && x <= r) {
					arr[i][2] = 1;
				}
			}
			for(int i = 0; i < m; i++) {
				if(arr[i][2] == 1) {
					for(int j = i + 1; j < m; j++) {
						if(arr[i][0] <= arr[j][0] && arr[i][1] >= arr[j][0]) {
							arr[j][2] = 1;
						} 
						if(arr[i][0] > arr[j][0] && arr[j][1] >= arr[i][0]) {
							arr[j][2] = 1;
						}
					}
				}
				if(arr[i][2] == 1) {
					list.add(arr[i]);
				}
			}
			list.add(new int[] {x, x});
			Collections.sort(list, (A, B) -> A[0] - B[0]);
			long ans = 0;
			for(int i = 0; i < list.size(); ) {
				int j = i + 1, end = list.get(i)[1], start = list.get(i)[0];
				while(j < list.size() && list.get(j)[0] <= end) {
					end = Math.max(list.get(j)[1], end);
					j++;
				}
				ans += (end - start + 1);
				i = j;
			}
			System.out.println(ans);
		}
		out.flush();
	}
	
	

}
