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.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.StringTokenizer;

public class Main {
	static int N, X, M;
	static int L[] = new int[101], R[] = new int[101];

	public static void main(String args0[]) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
		int T = Integer.parseInt(br.readLine().trim());
		for (int t = 1; t <= T; t++) {
			StringTokenizer st = new StringTokenizer(br.readLine());
			N = Integer.parseInt(st.nextToken());
			X = Integer.parseInt(st.nextToken());
			M = Integer.parseInt(st.nextToken());
			for (int i = 1; i <= M; i++) {
				st = new StringTokenizer(br.readLine());
				L[i] = Integer.parseInt(st.nextToken());
				R[i] = Integer.parseInt(st.nextToken());
			}
			bw.write(solve() + "\n");
		}
		bw.close();
	}

	public static int solve() {
		int startRange, endRange;
		startRange = endRange = 0;
		boolean startFlag = false;
		for (int i = 1; i <= M; i++) {
			if (!startFlag && L[i] <= X && X <= R[i]) {
				startFlag = true;
				startRange = L[i];
				endRange = R[i];
			} else if (startFlag && (isContain(startRange, endRange, L[i]) || isContain(startRange, endRange, R[i])
					|| isContain(L[i],R[i],endRange) || isContain(L[i],R[i],startRange))) {
				startRange = Math.min(startRange, L[i]);
				endRange = Math.max(endRange, R[i]);
			}
		}
		return endRange - startRange + 1;
	}

	public static boolean isContain(int start, int end, int target) {
		return start <= target && target <= end ? true : false;
	}
}