#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

#define MOD 1000000007
#define MOD2 998244353
#define int long long
#define double long double
#define EPS 1e-9
//#define PI 3.14159265358979

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;

template < typename T >
ostream &operator<<(ostream &os, const vector< T > &A) {
	for (int i = 0; i < A.size(); i++)
		os << A[i] << " ";
	os << endl;
	return os;
}
template <>
ostream &operator<<(ostream &os, const vector< vector< int > > &A) {
	int N = A.size();
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < A[i].size(); j++)
			os << A[i][j] << " ";
		os << endl;
	}
	return os;
}
template < typename T, typename U >
ostream &operator<<(ostream &os, const pair< T, U > &p) {
	os << "(" << p.first << "," << p.second << ")";
	return os;
}

typedef pair< int, int > pii;
typedef long long ll;

struct edge {
	int from, to, d, c, i;
	edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
		from = _from;
		to = _to;
		d = _d;
		c = _c;
	}
	bool operator<(const edge &rhs) const {
		return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
	}
};
struct aabb {
	int x1, y1, x2, y2;
	aabb(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {}
};

typedef vector< edge > edges;
typedef vector< edges > graph;
struct flow {
	int to, cap, rev, cost;
	flow(int to = 0, int cap = 0, int rev = 0, int cost = 0) : to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector< vector< flow > > flows;

const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);

int pow2(int n) { return 1LL << n; }
template < typename T, typename U >
bool chmin(T &x, const U &y) {
	if (x > y) {
		x = y;
		return true;
	}
	return false;
}
template < typename T, typename U >
bool chmax(T &x, const U &y) {
	if (x < y) {
		x = y;
		return true;
	}
	return false;
}

template < typename A, size_t N, typename T >
void Fill(A (&array)[N], const T &val) {
	fill((T *)array, (T *)(array + N), val);
}
struct initializer {
	initializer() {
		cout << fixed << setprecision(20);
	}
};
initializer _____;
struct event {
	int x, t;
};
struct BIT {
	vector< int > container;
	BIT(int n) {
		container = vector< int >(n + 1, 0);
	}

private:
	void internal_add(int i, int x) {
		if (i >= container.size() || i <= 0)
			return;
		container[i] += x;
		internal_add(i + (i & -i), x);
	}
	int internal_sum(int i) { //[1,i]
		if (i == 0)
			return 0;
		return container[i] + internal_sum(i - (i & -i));
	}

public:
	//0-indexed
	void add(int i, int x) {
		internal_add(i + 1, x);
	}
	//0-indexed[0,r]
	int sum(int r) {
		return internal_sum(r + 1);
	}
	//0-indexed[l,r)
	int sum(int l, int r) {
		return internal_sum(r - 1 + 1) - internal_sum(l - 1 + 1);
	}
};
int N, M, K, T, Q, H, W;
signed main() {
	cin >> N >> Q;
	vector< int > C(N);
	rep(i, N) {
		cin >> C[i];
		--C[i];
	}
	BIT bt(N);
	vector< tuple< int, int, int > > E(Q);
	rep(i, Q) {
		int l, r;
		cin >> l >> r;
		--l;
		--r;
		E[i] = make_tuple(r, l, i);
	}
	sort(E.begin(), E.end());
	vector< int > R(N, -1);
	vector< int > ans(Q);
	int j = 0;
	rep(i, N) {
		bt.add(R[C[i]], -1);
		R[C[i]] = i;
		bt.add(R[C[i]], 1);
		while (j < Q) {
			int l, r, k;
			tie(r, l, k) = E[j];
			if (r > i)
				break;
			ans[k] = bt.sum(l, r + 1);
			j++;
		}
	}
	rep(i, Q) cout << ans[i] << endl;
	return 0;
}

Measured memory_bytes: 31096