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;
#define INF LONG_LONG_MAX
#define int long long
#define ar array
const int mxn=5e5+4;
int t[mxn];
int n,q;
void upd(int u,int d)
{
    while(u<=n)
    {
        t[u]+=d;
        u+=u&-u;
    }
}
int sum(int u)
{
    int s=0;
    while(u)
    {
       s+=t[u];
       u-=u&-u; 
    }
    return(s);
}
int que(int l,int r)
{
    return(sum(r)-sum(l-1));
}
int c[mxn];
vector<int> qr[mxn],qi[mxn];
int pos[mxn],ans[mxn];
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>q;
    for (int i=1;i<=n;i++) cin>>c[i];
    for (int i=0;i<q;i++)
    {
        int l,r;
        cin>>l>>r;
        qr[r].push_back(l);
        qi[r].push_back(i);
    }
    for (int i=1;i<=n;i++)
    {   
        if (pos[c[i]]>0) upd(pos[c[i]],-1);
        upd(i,1);   
        pos[c[i]]=i;
        for (int j=0;j<qr[i].size();j++)
        {
            ans[qi[i][j]]=que(qr[i][j],i);
        }
    }
    for (int i=0;i<q;i++) cout<<ans[i]<<"\n";
    return 0;
}