/*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
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define int long long 
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back

#define RE(i,n) for (int i = 1; i <= n; i++)
#define RED(i,n) for (int i = n; i > 0; i--)
#define REPS(i,n) for(int i = 1; (i*i) <= n; i++)
#define REP(i,n) for (int i = 0; i < (int)n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)

#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define vi vector<int>
#define vvi vector<vi>
#define print(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout << *it << " "; cout << endl;
#define debug(x) cout << x << endl;
#define debug2(x,y) cout << x << " " << y << endl;
#define debug3(x,y,z) cout << x << " " << y << " " << z << endl;

typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;

const int INF = 1e18+1;
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264338;

int raise(int a,int n,int m = MOD){
  if(n == 0)return 1;
  if(n == 1)return a;
  int x = 1;
    x *= raise(a,n/2,m);
    x %= m;
    x *= x;
    x %= m;
    if(n%2)x*= a;
    x %= m;
    return x;
}

int floor1(int n,int k){
    if(n%k == 0 || n >= 0)return n/k;
    return (n/k)-1;
}

int ceil1(int n,int k){
    return floor1(n+k-1,k);
}

const int N = 5e5+1;
vector<int> seg[4*N];
int c[N];
int pri[N];
int n,q;
vector<int> all[N];

#define child 2*node 
#define mid (l+r)/2

void build(int node,int l,int r){
	if(l == r){
		seg[node] = {pri[l]};
		return;
	}
	build(child,l,mid);
	build(child+1,mid+1,r);
	int i = 0;
	int j = 0;
	while(i < seg[child].size() and j < seg[child+1].size()){
		if(seg[child][i] < seg[child+1][j]){
			seg[node].pb(seg[child][i]);
			i++;
		}
		else{
			seg[node].pb(seg[child+1][j]);
			j++;
		}
	}
	while(i < seg[child].size()){
		seg[node].pb(seg[child][i]);
		i++;
	}
	while(j < seg[child+1].size()){
		seg[node].pb(seg[child+1][j]);
		j++;
	}
}

int query(int node,int l,int r,int start,int end){
	if(end < l or r < start)return 0;
	#undef mid
	if(start <= l and r <= end){
		if(seg[node][0] >= start){
			return 0;
		}
		int lo = 0;
		int hi = seg[node].size();hi--;
		while(lo < hi){
			int mid = (lo+hi+1)/2;
			if(seg[node][mid] >= start)hi = mid-1;
			else lo = mid;
		}
		return lo+1;
	}
	#define mid (l+r)/2
	return query(child,l,mid,start,end)+query(child+1,mid+1,r,start,end);
}

void solve(){
  	cin >> n >> q;
  	RE(i,n){
  		cin >> c[i];
  		all[i].pb(0);
  	}
  	RE(i,n){
  		all[c[i]].pb(i);
  	}
  	RE(i,n){
  		RE(j,(int)all[i].size()-1){
  			pri[all[i][j]] = all[i][j-1];
  		}
  	}
  	build(1,1,n);
  	while(q--){
  		int l,r;
  		cin >> l >> r;
  		cout << query(1,1,n,l,r) << "\n";
  	}
}

signed main(){
  ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  //freopen(".in","r",stdin);freopen(".out","w",stdout);
  int t = 1;
  //cin >> t;
  while(t--){
    solve();
  }
  return 0;
}

Measured memory_bytes: 192536