We say that a odd number N is similar to 2017 when both N and (N+1)/2 are prime.

You are given Q queries.

In the i-th query, given two odd numbers l_i and r_i, find the number of odd numbers x similar to 2017 such that l_i ≤ x ≤ r_i.

Constraints

* 1≤Q≤10^5
* 1≤l_i≤r_i≤10^5
* l_i and r_i are odd.
* All input values are integers.

Input

Input is given from Standard Input in the following format:


Q
l_1 r_1
:
l_Q r_Q


Output

Print Q lines. The i-th line (1≤i≤Q) should contain the response to the i-th query.

Examples

Input

1
3 7


Output

2


Input

4
13 13
7 11
7 11
2017 2017


Output

1
0
0
1


Input

6
1 53
13 91
37 55
19 51
73 91
13 49


Output

4
4
1
1
1
2
import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		new Main();
	}

	final int MAX = 100000;

	public Main() {
		Scanner sc = new Scanner(System.in);
		boolean sieve[] = new boolean[MAX + 1];
		Arrays.fill(sieve, true);
		Arrays.fill(sieve, 0, 2, false);
		for (int i = 2;i < sieve.length;++ i) if (sieve[i]) for (int j = 2 * i;j < sieve.length;j += i) sieve[j] = false; // エラトステネスの篩
		int cumsum[] = new int[MAX + 1];
		cumsum[0] = 0;
		for (int i = 1;i < cumsum.length;++ i) cumsum[i] = cumsum[i - 1] + (sieve[i] & sieve[(i + 1)/ 2] ? 1 : 0); // 累積和
		int Q = sc.nextInt();
		while(Q-- != 0) {
			int l = sc.nextInt(), r = sc.nextInt();
			System.out.println(cumsum[r] - cumsum[l - 1]);
		}
		sc.close();
	}
}
