#include "bits/stdc++.h"
using namespace std;
const auto start_time = std::chrono::high_resolution_clock::now();
void timecalculater(){
    #ifndef ONLINE_JUDGE
    auto end_time = std::chrono::high_resolution_clock::now();
    std::chrono::duration<double> diff = end_time-start_time;
    cerr<<"Time Taken : "<<diff.count()<<"\n";
    #endif
}//continue break
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void __print(int x) {cout << x;}
void __print(long x) {cout << x;}
void __print(long long x) {cout << x;}
void __print(unsigned x) {cout << x;}
void __print(unsigned long x) {cout << x;}
void __print(unsigned long long x) {cout << x;}
void __print(float x) {cout << x;}
void __print(double x) {cout << x;}
void __print(long double x) {cout << x;}
void __print(char x) {cout << '\'' << x << '\'';}
void __print(const char *x) {cout << '\"' << x << '\"';}
void __print(const string &x) {cout << '\"' << x << '\"';}
void __print(bool x) {cout << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cout << '{'; __print(x.first); cout << ','; __print(x.second); cout << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cout << '{'; for (auto &i: x) cout << (f++ ? "," : ""), __print(i); cout << "}";}
void _print() {cout << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cout << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define dbg(x...) cout << "[" << #x << "] = ["; _print(x)
#else
#define dbg(x...)
#endif
#define fastio  cin.sync_with_stdio(0); cin.tie(0);cin.exceptions(cin.failbit);
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repA(i, a, n) for(int  i = a; i <= (n); ++i)
#define all(x) x.begin(), x.end()
#define sz(x) (int) (x).size()
#define fill(a,v) memset(a, v, sizeof(a))
#define fst first
#define snd second
#define mp make_pair
#define pb push_back
#define endl '\n'
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<int> vi;
typedef vector<long long int> vll;
typedef vector<pii> vpii;
ll p=1e9+7;
const int N=2e5+5;
int n,q;
struct node
{
    int l,r,i;    
};
int s;
bool comp(node a,node b){
    if((a.l/s)==(b.l/s)){
        return a.r<b.r;
    }
    return (a.l/s)<(b.l/s); 
}
ll answer=0;
ll arr[1000001];
void add(int pos,int *a){
    int x=a[pos];
    int cnt=arr[x];
    arr[x]++;
    if(arr[x]==1)answer++;
}
void remove(int pos,int *a){
    int x=a[pos];
    int cnt=arr[x];
    arr[x]--;
    if(arr[x]==0)answer--;
}
int main() {
   
    fastio;
    int T=1;
    // cin>>T;
    while(T--){
        cin>>n>>q;
        int a[n+1];rep(i,n) cin>>a[i+1];
        s=sqrt(n);
        node que[q];
        rep(i,q) cin>>(que[i].l)>>(que[i].r),que[i].i=(i);
        sort(que,que+q,comp);
        ll ans[q];
        int cl=0,cr=0;
        memset(arr,0,sizeof(arr));
        a[0]=0;
        rep(i,q){
            int l=que[i].l,r=que[i].r;
            vector<int> v;
            while(cl<l){
                remove(cl,a);cl++;
            }
            while(cl>l){
                cl--;add(cl,a);
            }
            while(cr<r){
                cr++;add(cr,a);
            }
            while(cr>r){
                remove(cr,a);cr--;
            }
            ans[que[i].i]=answer;
        }
        rep(i,q){
            cout<<ans[i]<<endl;
        }

    }   
    timecalculater();
    return 0;   
} 

Measured memory_bytes: 23336