Given an array of N integers indexed from 1 to N, and q queries, each in the form i j, you have to find the number of distinct integers from index i to j (inclusive).

Input starts with an integer T (≤ 5), denoting the number of test cases.

The first line of a case is a blank line. The next line contains two integers N (1 ≤ N ≤ 10⁵), q (1 ≤ q ≤ 50000). The next line contains N space separated integers forming the array. There integers range in [0, 10⁵].

Each of the next q lines will contain a query which is in the form i j (1 ≤ i ≤ j ≤ N).

For each test case, print the case number in a single line. Then for each query you have to print a line containing number of distinct integers from index i to j.

Dataset is huge. Use faster I/O methods.