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;

const int N = 500000;
const int B = 700;

struct query {
  int l, r, i;
  bool operator<(const query &other) const {
    return make_pair(l / B, r) < make_pair(other.l / B, other.r);
  }
};

int c[N];
query qs[N];
int ans[N];
int f[N], cnt = 0;

void add(int value) {
  if(++f[value] == 1)
    cnt++;
}

void remove(int value) {
  if(--f[value] == 0)
    cnt--;
}

int main() {
  int n, q; scanf("%d %d", &n, &q);
  for(int i = 0; i < n; ++i) {
    scanf("%d", c + i);
  }
  for(int i = 0; i < q; ++i) {
    int l, r; scanf("%d %d", &l, &r);
    qs[i] = {l - 1, r - 1, i};
  }
  sort(qs, qs + q);
  int cur_l = 0, cur_r = -1;
  for(int i = 0; i < q; ++i) {
    while(cur_l > qs[i].l) {
      add(c[--cur_l]);
    }
    while(cur_r < qs[i].r) {
      add(c[++cur_r]);
    }
    while(cur_l < qs[i].l) {
      remove(c[cur_l++]);
    }
    while(cur_r > qs[i].r) {
      remove(c[cur_r--]);
    }
    ans[qs[i].i] = cnt;
  }
  for(int i = 0; i < q; ++i) {
    printf("%d\n", ans[i]);
  }
  return 0;
}
