#include<bits/stdc++.h>
            //#include<ext/pb_ds/assoc_container.hpp>
            //#include<ext/pb_ds/tree_policy.hpp>
          //  using namespace __gnu_pbds;
            using namespace std;
            # define ll long long
            # define int long long  //comment it out when MLE
            # define endl "\n"
           // template <typename T>
            //using ordered_set = tree<T, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;

            #define gok ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
            //# define m 163577857
            # define mo 1000000007
            # define pi acos(-1)
           # define fi first
            # define se second
            # define pb push_back
            # define pii pair<int,int>
            #define REP(i,n) for (int i = 1; i <= n; i++)
            const int mod =  1e9+7;
            //const int K = 2;
            //typedef vector<vector<int> > matrix;
/*
          int add(int a, int b,int mod) {
                a%=mod;
                b%=mod;
                a += b;
                if (a >= mod) a -= mod;
                if(a<0)
                {
                    a += mod;
                    a %= mod;
                }
                return a;
            }

            int mul(ll a, int b,int mod) {
                a%=mod;
                b%=mod;
                a *= b;
                a += mod;
                return a % mod;
            }
            int po(int a,int b,int mod)
            {
                if(b==0)
                    return 1;
                if(b%2==0)
                    return po(mul(a,a,mod),b/2,mod);
                return mul(a,po(mul(a,a,mod),(b-1)/2,mod),mod);
            }


            ll fact[200003];
            ll inv[200003];

            void fact0()
            {
                int i,j;
                fact[0]=1;
                for(i=1;i<=200000;i++)
                {
                    fact[i]=i*fact[i-1]%mod;
                }
                inv[0]=1;
                inv[1]=1;
                ll p=mod;
                for (i=2; i<=200000; i++)
                    inv[i] = (p - (p/i) * inv[p%i] % p) % p;

                for(i=2;i<=200000;i++)
                {
                    inv[i]*=inv[i-1];
                    inv[i]%=mod;
                }
            }
            int help(int a,int b)
            {
               // cout<<a<<" "<<b<<endl;
                int an = fact[a];
                //cout<<an<<endl;
                an *= inv[b];
                an %= mod;
                an *= inv[a-b];
                an %= mod;
                return an;
            }
/*
          void random()
            {
              srand(time(0));
            for (int i = 0; i < n; i ++)
                perm[i] = i + 1;
            random_shuffle(perm, perm + n);
            }
int ncr(int a,int b)
{
    int tt = fact[a];
    tt %= mod;
    tt *= inv[a-b];
    tt %= mod;
    tt *= inv[b];
    tt %= mod;
    return tt;
}
*/

vector<pair<int,pii>> v;
 map<int,int> mp;
 int re[500005],a[500005];
int bit[500005];
void update(int idx, int val)
	{
		while(idx <= 500005)
		{
			bit[idx] += val;
			idx += idx & -idx;
		}
	}

	int pref(int idx)
	{
		int ans = 0;
		while(idx > 0)
		{
			ans += bit[idx];
			idx -= idx & -idx;
		}
		return ans;
	}



signed main() {
	gok

	int n,q;
	cin>>n>>q;

	for(int i=0;i<n;i++)
        cin>>a[i];

    int id=0;
    while(q--)
    {
        int x,y;
        cin>>x>>y;
        x--;
        y--;
        v.pb({y,{x,id}});
        id++;
    }

    sort(v.begin(),v.end());

    int cc=0;
    int st=0;
    id=0;
    for(int i=0;i<n;i++)
    {
        if(mp.find(a[i])==mp.end())
        {
            mp[a[i]] = i+1;
            update(i+1,1);
        }
        else
        {
            update(mp[a[i]],-1);
            mp[a[i]] = i+1;
            update(i+1,1);
        }

       while(v[id].fi==i)
       {
           int l = v[id].se.fi,r=v[id].fi,idx=v[id].se.se;
           int an = pref(r+1) - pref(l);
           re[idx] = an;
           id++;
       }
    }

    for(int i=0;i<v.size();i++)
        cout<<re[i]<<endl;




























  return 0;
}


Measured memory_bytes: 58528