#include<bits/stdc++.h>
using namespace std;
#define MAX 200005
int bit[MAX],n,q;
map<int,int>mp;
struct Query
{int l,r,id;bool operator < (const Query& a)const{return r<a.r;}
}b[MAX];
int gsum(int i)
{int s=0;while(i>0){s+=bit[i];i-=i&-i;}return s;
}
void add(int i,int k)
{while(i<=n){bit[i]+=k;i+=i&-i;}
}
int main()
{while(~scanf("%d %d",&n,&q)){mp.clear();memset(bit,0,sizeof(bit));vector<int>a(n*2+10),ans(q);for(int i=1;i<=n;i++){scanf("%d",&a[i]);a[i+n]=a[i];}n=n*2;for(int i=0;i<q;i++){int l,r;scanf("%d %d",&l,&r);b[i].l=r;b[i].r=l+n/2;b[i].id=i;}sort(b,b+q);int pre=1;for(int i=0;i<q;i++){for(int j=pre;j<=b[i].r;j++){if(mp[a[j]]){add(mp[a[j]],-1);}add(j,1);mp[a[j]]=j;}pre=b[i].r+1;ans[b[i].id]=gsum(b[i].r)-gsum(b[i].l-1);}for(int i=0;i<q;i++){printf("%d\n",ans[i]);}}
}

#include<bits/stdc++.h>
using namespace std;
#define MAX 100005
int block[MAX],ans[MAX],n,b[MAX];
int sum=0;
int read()
{char ch=' ';int ans=0;while(ch>'9'||ch<'0')ch=getchar();while(ch>='0'&&ch<='9'){ans=ans*10+ch-'0';ch=getchar();}return ans;
}
struct Query
{int l,r,id;
}s[MAX];
bool cmp(const Query&a,const Query&b)
{if(block[a.l]==block[b.l])return a.r<b.r;else return a.l<b.l;
}
void inc(int x)
{if(b[x]==0)sum++;b[x]++;
}
void dec(int x)
{b[x]--;if(b[x]==0)sum--;
}
int main()
{int q;while(~scanf("%d %d",&n,&q)){memset(b,0,sizeof(b));vector<int>a(n);for(int i=1;i<=n;i++){a[i]=read();block[i]=i/1000;}for(int i=1;i<=q;i++){s[i].l=read();s[i].r=read();s[i].id=i;}sort(s+1,s+q+1,cmp);int L=0,R=n+1;sum=0;for(int i=1;i<=q;i++){while(L<s[i].l){L++;inc(a[L]);}while(L>s[i].l){dec(a[L]);L--;}while(R<s[i].r){dec(a[R]);R++;}while(R>s[i].r){R--;inc(a[R]);}ans[s[i].id]=sum;}for(int i=1;i<=q;i++)printf("%d\n",ans[i]);}
}