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 <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;

struct query {
  int L, R, id;
} q[500020];

const int BLOCK = 1000;

bool cmp(query a, query b) {
  if (a.L / BLOCK != b.L / BLOCK)
    return a.L / BLOCK < b.L / BLOCK;
  else
    return a.R < b.R;
}

int a[500020], cnt[500020], ans[500020];

int main() {
  int n, m;
  scanf("%d", &n);
  scanf("%d", &m);
  for (int i = 1; i <= n; i++)
    scanf("%d", &a[i]);
  for (int i = 0; i < m; i++) {
    scanf("%d%d", &q[i].L, &q[i].R);
    q[i].id = i;
  }
  sort(q, q + m, cmp);
  int L = 0, R = 0, cur = 0;
  for (int i = 0; i < m; i++) {
    int left = q[i].L, right = q[i].R, id = q[i].id;
    while (L < left) {
      cur -= --cnt[a[L++]] == 0;
    }
    while (L > left) {
      cur += ++cnt[a[--L]] == 1;
    }
    while (R < right) {
      cur += ++cnt[a[++R]] == 1;
    }
    while (R > right) {
      cur -= --cnt[a[R--]] == 0;
    }
    ans[id] = cur;
  }
  for (int i = 0; i < m; i++)
    printf("%d\n", ans[i]);
  return 0;
}