We have N colored balls arranged in a row from left to right; the color of the i-th ball from the left is c_i.

You are given Q queries. The i-th query is as follows: how many different colors do the l_i-th through r_i-th balls from the left have?

Constraints

* 1\leq N,Q \leq 5 \times 10^5
* 1\leq c_i \leq N
* 1\leq l_i \leq r_i \leq N
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N Q
c_1 c_2 \cdots c_N
l_1 r_1
l_2 r_2
:
l_Q r_Q


Output

Print Q lines. The i-th line should contain the response to the i-th query.

Examples

Input

4 3
1 2 1 3
1 3
2 4
3 3


Output

2
3
1


Input

10 10
2 5 6 5 2 1 7 9 7 2
5 5
2 4
6 7
2 2
7 8
7 9
1 8
6 9
8 10
6 8


Output

1
2
2
1
2
2
6
3
3
3
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int sz = 5e5+5, rt = 1000;

int a[sz], cnt[sz], ans[sz], now;

struct dtt {
   int l, r, id;
} quers[sz];

bool cmp(dtt a, dtt b) {
   if(a.l / rt == b.l / rt) return a.r < b.r;
   return a.l < b.l;
}

inline void add(int x) {
   if(!cnt[a[x]]) now++;
   cnt[a[x]]++;
}

inline void del(int x) {
   cnt[a[x]]--;
   if(!cnt[a[x]]) now--;
}

int main() {
   int n, q;
   scanf("%d %d", &n, &q);
   for(int i=0; i<n; i++) scanf("%d", &a[i]);
   for(int i=0; i<q; i++) {
      int x, y;
      scanf("%d %d", &x, &y);
      quers[i] = {x-1, y-1, i};
   }
   sort(quers, quers+q, cmp);

   for(int i=0, l=0, r=-1; i<q; i++) {
      while(l < quers[i].l) del(l++);
      while(quers[i].l < l) add(--l);
      while(r < quers[i].r) add(++r);
      while(quers[i].r < r) del(r--);
      ans[quers[i].id] = now;
   }
   for(int i=0; i<q; i++) printf("%d\n", ans[i]);
}
