|All-time Popular Problems|
|Check if subtree|
|Print BST elements in given range|
|Angle between hour and minute hand|
|Remove duplicate element from sorted Linked List|
|Smallest Positive missing number|
|Remove loop in Linked List|
|Find median in a stream|
|n'th node from end of linked list|
|Check for BST|
Pasha is obsessed with Prime Numbers. He has an array of N Numbers (1 based indexing). His friends keep asking him the number of primes in the subarray ranging from l to r (both inclusive). He is tired of answering them, and so asks for your help.
The First Line contains T- testcases.
The first line of each Testcase contains two integers -N(Size of the array)and Q(Number of Queries)
The next line contains N integers -denoting the array.
The next Q Lines contains two integers L and R.
For each test case, Answer the query on a new line.
1 ≤ L<=R ≤ N
2 5 6 7 8
In the first query- THe Primes in the subarray [2,5,6] are 2 and 5.
In the Second query- THe Primes in the subarray [5,6,7,8] are 5 and 7.
In the Third query- THere is no Prime in the subarray .