#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace __gnu_pbds;
using namespace std;

const int OO = 1e9;
const double EPS = 1e-9;

#define ndl cout << '\n'
#define sz(v) int(v.size())
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define present(a, x) (a.find(x) != a.end())
#ifdef LOCAL
#define db(...) ({cout << "> Line " << __LINE__  \
		<< ": "; _db(#__VA_ARGS__, __VA_ARGS__);})
#define RNG() rng()
#else
#define db(...) true
#define RNG() true
#endif

template<class T>
void _db(const char *dbStr, T e) {
	cout << dbStr << " = " << e << endl;
}
template<class T, class... L>
void _db(const char *dbStr, T e, L... r) {
  while(*dbStr != ',') cout << *dbStr++;
  cout << " = " << e << ','; _db(dbStr + 1, r...);
}
template<class S, class T>
ostream& operator<<(ostream& o, const map<S, T>& v) {
	o << "["; int i = 0;
	for (const pair<S, T>& pr : v) o << (!i++ ? "" : ", ") << "{"
	<< pr.fs << " : " << pr.sc << "}"; return o << "]";
}
template<template <class, class...> class S, class T, class... L>
ostream& operator<<(ostream& o, const S<T, L...>& v) {
	o << "["; int i = 0;
	for (const auto& e : v) o << (!i++ ? "" : ", ") << e;
	return o << "]";
}
template<class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& pr) {
	return o << "(" << pr.fs << ", " << pr.sc << ")";
}
ostream& operator<<(ostream& o, const string& s) {
	for (const char& c : s) o << c;
	return o;
}

template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = VV<V<T>>;
using ll = long long;
using pii = pair<int, int>;
using vi = V<int>;
using vii = V<pii>;
using vvi = VV<int>;
using mii = map<int, int>;
using umii = unordered_map<int, int>;
using si = set<int>;
using usi = unordered_set<int>;

typedef
tree<
  int,
  null_type,	// put a type to use as a map
  less<int>,
  rb_tree_tag,
  tree_order_statistics_node_update>
ordered_set;

template<class T> using pb_set = tree<T, null_type,
	less<T>, rb_tree_tag, tree_order_statistics_node_update>;

template<class T>
ostream& operator<<(ostream& o, const pb_set<T>& v) {
	o << "["; int i = 0;
	for (const auto& e : v) o << (!i++ ? "" : ", ") << e;
	return o << "]";
}

const int MX = 5e5 + 5;
int N, Q;
vi idx[MX], c;
vi ans;
vii queries[MX];


int main() {
	#ifdef LOCAL
	auto stTime = clock();
//	freopen("in.txt", "r", stdin);
	mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
	#endif
	ios::sync_with_stdio(false);
	cout.precision(10);
	cin.tie(0);

	cin >> N >> Q;

	c.assign(N + 1, 0);

	for (int i = 1; i <= N; ++i) {
		cin >> c[i];
		idx[c[i]].pb(i);
	}

	for (int i = 1; i <= N; ++i)
		idx[i].pb(N + 1);

	vi ans(Q);

	for (int i = 0; i < Q; ++i) {
		int l, r;
		cin >> l >> r;
		queries[l].pb(mp(r, i));
	}

	pb_set<pair<int, pair<int, int>>> s;

	for (int i = 1; i <= N; ++i)
		s.insert(mp(idx[i][0], mp(i, 0)));

	for (int l = 1; l <= N; ++l) {
		while (s.begin()->fs < l) {
			auto elem = *s.begin();
			s.erase(s.begin());
			elem.sc.sc++;
			elem.fs = idx[elem.sc.fs][elem.sc.sc];
			s.insert(elem);
		}

		for (auto& pr : queries[l]) {
			int r = pr.fs, idx = pr.sc;
			auto it = s.lower_bound(mp(r + 1, mp(0, 0)));
			--it;
			ans[idx] = 1 + s.order_of_key(*it);
		}

	}

	for (int i = 0; i < Q; ++i)
		cout << ans[i] << '\n';


	#ifdef LOCAL
	cout << "\n\n\nExecution time: " <<
		(clock() - stTime) * 1e3 / CLOCKS_PER_SEC << " ms" << endl;
	#endif
	return 0;
}


Measured memory_bytes: 90008