#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define int ll
#define s second
#define f first
using namespace std;
const int N = 500005,Bl = 770;
int a[N],res,ans[N];
pair<pair<int,int>,int> d[N];
map <int,int> cnt;
bool cmp(pair<pair<int,int>,int> a, pair<pair<int,int>,int> b){
if (a.f.f/Bl != b.f.f/Bl) return a.f.f/Bl < b.f.f/Bl;
return a.f.s < b.f.s;
}
void add(int idx){
cnt[a[idx]]++;
if (cnt[a[idx]] == 2) res++;
if (cnt[a[idx]] == 3) res--;
}
void del(int idx){
cnt[a[idx]]--;
if (cnt[a[idx]] == 1) res--;
if (cnt[a[idx]] == 2) res++;
}
signed main() {
ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
int n,q;
cin>>n>>q;
for(int i = 1; i<=n;i++)
cin>>a[i];
for (int i = 1; i <= q; i++){
int l,r;
cin>>l>>r;
d[i] = {{l,r},i};
}
sort(d+1,d+q+1,cmp);
int L=0,R = -1;
for (int i = 1; i <= q; i++){
int l = d[i].f.f,r = d[i].f.s,id = d[i].s;
while(L > l) add(--L);
while(R < r) add(++R);
while(L < l) del(L++);
while(R > r) del(R--);
ans[id] = res;
}
for (int i=1;i<=q;i++)
cout<<ans[i]<<endl;
}
