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 <tuple>
#include <utility>
#include <iostream>
#include <vector>
using namespace std;

int main(){
  int N, Q;
  cin >> N >> Q;
  vector<int> C(N);
  for(int i = 0; i < N; ++i)
    cin >> C[i], --C[i];
  const int b = 1000;
  vector<vector<tuple<int,int,int>>> query(b);
  for(int i = 0; i < Q; ++i){
    int l, r;
    cin >> l >> r;
    --l;
    query[l/b].emplace_back(r,l,i);
  }
  for(auto& q : query)
    sort(q.begin(), q.end());
  vector<int> ans(Q);
  for(const auto& q : query){
    if(q.empty()) continue;
    vector<int> cnt(N);
    int m = 0;
    int ll = get<1>(q[0]), rr = ll;
    for(auto [r, l, i] : q){
      while(rr < r){
        ++cnt[C[rr]];
        if(cnt[C[rr]] == 1)
          ++m;
        ++rr;
      }
      while(ll < l){
        --cnt[C[ll]];
        if(!cnt[C[ll]])
          --m;
        ++ll;
      }
      while(ll > l){
        --ll;
        ++cnt[C[ll]];
        if(cnt[C[ll]] == 1)
          ++m;
      }
      ans[i] = m;
    }
  }
  for(auto e : ans)
    cout << e << '\n';
}
