We have N colored balls arranged in a row from left to right; the color of the i-th ball from the left is c_i.

You are given Q queries. The i-th query is as follows: how many different colors do the l_i-th through r_i-th balls from the left have?

Constraints

* 1\leq N,Q \leq 5 \times 10^5
* 1\leq c_i \leq N
* 1\leq l_i \leq r_i \leq N
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N Q
c_1 c_2 \cdots c_N
l_1 r_1
l_2 r_2
:
l_Q r_Q


Output

Print Q lines. The i-th line should contain the response to the i-th query.

Examples

Input

4 3
1 2 1 3
1 3
2 4
3 3


Output

2
3
1


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


Output

1
2
2
1
2
2
6
3
3
3
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define vi vector<int>
#define all(a) a.begin(),a.end()
typedef pair<int,int> P;
const long long mod=998244353;
const long long inf=1ll<<61;
struct BIT {
	int node[500006]; int N = 500002;
	void init() {
		fill(node, node + N + 1, 0);
	}
	void add(int i, int x) {
		while (i <= N) {
			node[i] += x; i += i & -i;
		}
	}
	int sum(int x) {
		int s = 0;
		while (x > 0) {
			s += node[x]; x -= x & -x;
		}
		return s;
	}
};
int c[500006];
int l[500006],r[500006];
struct query{
	int l,id;
};

BIT b;
int app[500006];
int ans[500006];
vector<query>Q[500006];

signed main(){
	int n,q;cin>>n>>q;
	rep(i,n){
		cin>>c[i];
		c[i]--;
	}
	rep(i,q){
		cin>>l[i]>>r[i];
		l[i]--;r[i]--;
		Q[r[i]].push_back({l[i],i});
	}
	
	fill(app,app+n+1,-1);
	rep(i,n){
		if(app[c[i]]==-1){
			app[c[i]]=i;
			b.add(i+1,1);
		}
		else{
			b.add(app[c[i]]+1,-1);
			app[c[i]]=i;
			b.add(i+1,1);
		}
		for(auto e:Q[i]){
			ans[e.id]=b.sum(i+1)-b.sum(e.l);
		}
	}
	rep(i,q)cout<<ans[i]<<endl;
}