#include <bits/stdc++.h>
using namespace std;
#if __has_include(<boost/multiprecision/cpp_int.hpp>)
	#include <boost/multiprecision/cpp_int.hpp>
	#include <boost/multiprecision/cpp_dec_float.hpp>
	using bll = boost::multiprecision::cpp_int;
	using bdouble = boost::multiprecision::number<boost::multiprecision::cpp_dec_float<100>>;
	using namespace boost::multiprecision;
#endif
#if __has_include(<boost/stacktrace.hpp>)
	#define BOOST_STACKTRACE_USE_ADDR2LINE
	#define BOOST_STACKTRACE_ADDR2LINE_LOCATION /usr/local/opt/binutils/bin/addr2line
	#define _GNU_SOURCE 1
	#include <boost/stacktrace.hpp>
#endif
#ifdef LOCAL_TEST
	namespace std {
		template<typename T> class dvector : public std::vector<T> {
		public:
			dvector() : std::vector<T>() {}
			explicit dvector(size_t n, const T& value = T()) : std::vector<T>(n, value) {}
			dvector(const std::vector<T>& v) : std::vector<T>(v) {}
			dvector(const std::initializer_list<T> il) : std::vector<T>(il) {}
			dvector(const std::string::iterator first, const std::string::iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::iterator first, const typename std::vector<T>::iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::reverse_iterator first, const typename std::vector<T>::reverse_iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::const_iterator first, const typename std::vector<T>::const_iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::const_reverse_iterator first, const typename std::vector<T>::const_reverse_iterator last) : std::vector<T>(first, last) {}
			T& operator[](size_t n) {
				try { return this->at(n); } catch (const std::exception& e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; return this->at(n); }
			}
			const T& operator[](size_t n) const {
				try { return this->at(n); } catch (const std::exception& e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; return this->at(n); }
			}
		};
	}
	class dbool {
	private:
		bool boolvalue;
	public:
		dbool() : boolvalue(false) {}
		dbool(bool b) : boolvalue(b) {}
		operator bool&() { return boolvalue; }
		operator const bool&() const { return boolvalue; }
	};
	#define vector dvector
	#define bool dbool
#endif
#ifdef LOCAL_DEV
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::vector<T>& v) {
		for (size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::vector<std::vector<T>>& vv) {
		s << "\\\n"; for (size_t i = 0; i < vv.size(); ++i){ s << vv[i] << "\n"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::deque<T>& v) {
		for (size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::set<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::multiset<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
	template <typename T, size_t N> std::ostream& operator<<(std::ostream& s, const std::array<T, N>& a) {
		s << "{ "; for (size_t i = 0; i < N; ++i){ s << a[i] << "\t"; } s << "}"; return s; }
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::map<T1, T2>& m) {
		s << "{\n"; for (auto itr = m.begin(); itr != m.end(); ++itr){ s << "\t" << (*itr).first << " : " << (*itr).second << "\n"; } s << "}"; return s; }
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::pair<T1, T2>& p) {
		return s << "(" << p.first << ", " << p.second << ")"; }
	class SIGFPE_exception : std::exception {};
	class SIGSEGV_exception : std::exception {};
	void catch_SIGFPE([[maybe_unused]] int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGFPE_exception(); }
	void catch_SIGSEGV([[maybe_unused]] int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGSEGV_exception(); }
	signed convertedmain();
	signed main() { signal(SIGFPE, catch_SIGFPE); signal(SIGSEGV, catch_SIGSEGV); return convertedmain(); }
	#define main() convertedmain()
	void debug_impl() { std::cerr << '\n'; }
	template<typename Head, typename... Tail> void debug_impl(Head head, Tail... tail) { std::cerr << " " << head << (sizeof...(tail) ? "," : ""); debug_impl(tail...); }
	#define debug(...) do { std::cerr << "(" << #__VA_ARGS__ << ") ="; debug_impl(__VA_ARGS__); } while (false)
#else
	#define debug(...) do {} while (false)
#endif
//#define int long long
using ll = long long;
//constexpr int INF = (ll)1e9 + 7;//INT_MAX=(1<<31)-1=2147483647
constexpr ll INF = (ll)1e18;//(1LL<<63)-1=9223372036854775807
constexpr ll MOD = (ll)1e9 + 7;
constexpr double EPS = 1e-9;
constexpr ll dx[4] = {1, 0, -1, 0};
constexpr ll dy[4] = {0, 1, 0, -1};
constexpr ll dx8[8] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr ll dy8[8] = {0, 1, 0, -1, 1, -1, 1, -1};
#define rep(i, n)   for(ll i=0, i##_length=(n); i< i##_length; ++i)
#define repeq(i, n) for(ll i=1, i##_length=(n); i<=i##_length; ++i)
#define rrep(i, n)   for(ll i=(n)-1; i>=0; --i)
#define rrepeq(i, n) for(ll i=(n)  ; i>=1; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
void p() { std::cout << '\n'; }
template<typename Head, typename... Tail> void p(Head head, Tail... tail) { std::cout << head << (sizeof...(tail) ? " " : ""); p(tail...); }
template<typename T> inline void pv(std::vector<T>& v) { for(ll i=0, N=v.size(); i<N; i++) std::cout << v[i] << " \n"[i==N-1]; }
template<typename T> inline bool chmax(T& a, T b) { return a < b && (a = b, true); }
template<typename T> inline bool chmin(T& a, T b) { return a > b && (a = b, true); }
template<typename T> inline void uniq(std::vector<T>& v) { v.erase(std::unique(v.begin(), v.end()), v.end()); }

/*-----8<-----template-----8<-----*/

template <class Integral, ::std::size_t Bitlength, Integral None>
class WaveletMatrix {
public:
	using value_type = Integral;
	using size_type = ::std::size_t;
	static constexpr value_type none = None;

private:
	class bitvector {
		using bitfield = ::std::uint_least64_t;
		static constexpr ::std::size_t wordsize = 64;
		static ::std::size_t popcount(bitfield c) {
#ifdef __has_builtin
			return __builtin_popcountll(c);
#else
			c = (c & 0x5555555555555555ULL) + (c >> 1 & 0x5555555555555555ULL);
			c = (c & 0x3333333333333333ULL) + (c >> 2 & 0x3333333333333333ULL);
			c = (c + (c >> 4)) & 0x0F0F0F0F0F0F0F0FULL;
			return static_cast<::std::size_t>(c * 0x0101010101010101ULL >> 56 & 0x7f);
#endif
		}
		using value_type = typename WaveletMatrix::value_type;
		using size_type = typename WaveletMatrix::size_type;
		::std::vector<::std::pair<bitfield, size_type>> dic;

	public:
		size_type cnt;
		value_type bit;
		constexpr bitvector() : dic(), cnt(0), bit(0) {}
		bitvector(const size_type size, const value_type b)
				: dic(size / wordsize + 1, {0, 0}), cnt(0), bit(b) {}
		void set(const size_type index) {
			dic[index / wordsize].first |= static_cast<bitfield>(1) << (index % wordsize);
		}
		void build() {
			const size_type len = dic.size();
			for (size_type i = 1; i < len; ++i)
				dic[i].second = dic[i - 1].second + popcount(dic[i - 1].first);
		}
		size_type rank(const size_type last) const {
			return dic[last / wordsize].second +
						popcount(dic[last / wordsize].first &
							((static_cast<bitfield>(1) << (last % wordsize)) - 1));
		}
		bool access(const size_type index) const {
			return dic[index / wordsize].first >> (index % wordsize) & 1;
		}
	};
	static bool valid(const value_type value) {
		return value == none || !(value >> (Bitlength - 1) >> 1);
	}
	::std::array<bitvector, Bitlength> matrix;
	size_type size_;

	size_type at_least(size_type first, size_type last, const value_type value) const {
		assert(first <= size());
		assert(last <= size());
		assert(first <= last);
		size_type ret = 0;
		for (const auto &v : matrix) {
			const size_type l = v.rank(first), r = v.rank(last);
			if (value & v.bit) {
				first = l + v.cnt;
				last = r + v.cnt;
			} else {
				ret += r - l;
				first -= l;
				last -= r;
			}
		}
		return ret + last - first;
	}

public:
	constexpr WaveletMatrix() : matrix(), size_(0) {}
	template <class InputIter>
	WaveletMatrix(InputIter first, InputIter last) : matrix(), size_(0) {
		::std::vector<value_type> vec0(first, last);
		const size_type len = vec0.size();
		size_ = len;
		::std::vector<value_type> vec_l(len), vec_r(len);
		size_type l, r;
		value_type temp = static_cast<value_type>(1) << (Bitlength - 1);
		for (auto &v : matrix) {
			v = bitvector(len, temp);
			temp >>= 1;
			l = 0;
			r = 0;
			for (size_type j = 0; j < len; ++j)
				if (vec0[j] & v.bit)
					vec_r[r++] = vec0[j], v.set(j);
				else
					vec_l[l++] = vec0[j];
			v.cnt = l;
			v.build();
			::std::swap(vec0, vec_l);
			::std::copy(vec_r.cbegin(), vec_r.cbegin() + r, vec0.begin() + l);
		}
	}

	size_type size() const noexcept { return size_; }
	bool empty() const noexcept { return size() == 0; }

	value_type operator[](size_type index) const {
		assert(index < size());
		value_type ret = 0;
		for (const auto &v : matrix)
			if (v.access(index))
				ret |= v.bit, index = v.rank(index) + v.cnt;
			else
				index -= v.rank(index);
		return ret;
	}
	value_type at(const size_type index) const {
		if (index < size())
			return operator[](index);
		else
			throw ::std::out_of_range("index out of range");
	}

	size_type rank(size_type first, size_type last, const value_type value) const {
		assert(first <= size());
		assert(last <= size());
		assert(first <= last);
		assert(valid(value));
		for (const auto &v : matrix)
			if (value & v.bit)
				first = v.rank(first) + v.cnt, last = v.rank(last) + v.cnt;
			else
				first -= v.rank(first), last -= v.rank(last);
		return last - first;
	}
	value_type quantile(size_type first, size_type last, size_type k = 0, const value_type upper = none) const {
		assert(first <= size());
		assert(last <= size());
		assert(valid(upper));
		if (upper != none)
			k += at_least(first, last, upper);
		if (last - first <= k)
			return none;
		value_type ret = 0;
		for (const auto &v : matrix) {
			const size_type l = v.rank(first), r = v.rank(last);
			if (r - l > k)
				first = l + v.cnt, last = r + v.cnt, ret |= v.bit;
			else
				first -= l, last -= r, k -= r - l;
		}
		return ret;
	}
	value_type rquantile(const size_type first, const size_type last, size_type k = 0, const value_type lower = none) const {
		assert(first <= size());
		assert(last <= size());
		assert(first <= last);
		assert(valid(lower));
		if (lower != none)
			k += last - first - at_least(first, last, lower);
		if (last - first <= k)
			return none;
		return quantile(first, last, last - first - k - 1, none);
	}
	size_type rangefreq(const size_type first, const size_type last, const value_type lower, const value_type upper) const {
		assert(first <= size());
		assert(last <= size());
		assert(first <= last);
		assert(valid(lower));
		assert(valid(upper));
		assert(lower == none || upper == none || lower <= upper);
		size_type ret = lower == none ? last - first : at_least(first, last, lower);
		return upper == none ? ret : ret - at_least(first, last, upper);
	}
};

/*-----8<-----library-----8<-----*/

void solve() {
	std::cin.tie(0);
   	ios::sync_with_stdio(false);
	
	ll N, Q;
	cin >> N >> Q;
	vector<ll> c(N);
	rep(i, N) { cin >> c[i]; c[i]--;}
	vector<ll> l(Q), r(Q);
	rep(i, Q) { cin >> l[i] >> r[i]; l[i]--;}

	//pair:{x,y}に1を加算する
	//「クエリに含まれる区間を調べる」をやるときは区間を閉区間[x,y]にすること！！
	vector<pair<ll,ll>> a;
	vector<ll> v(N,-1);
	rep(i,N){
		if(v[c[i]]!=-1)a.emplace_back(v[c[i]], i);
		v[c[i]]=i;
	}

	sort(all(a));
	vector<ll> w(a.size());
	rep(i,a.size())w[i]=a[i].second;

	const ll bitlength = 1 + log2(1e9);
	WaveletMatrix<ll,bitlength,0LL> wm(w.begin(), w.end());

	vector<ll> ans(Q);
	rep(i,Q){
		auto itx = lower_bound(a.begin(), a.end(), pair<ll,ll>(l[i],0), [](const pair<ll,ll> &x, const pair<ll,ll>& y) {
			return x.first < y.first;
		});
		ll x = itx - a.begin();
		auto ity = lower_bound(a.begin(), a.end(), pair<ll,ll>(r[i],0), [](const pair<ll,ll> &x, const pair<ll,ll>& y) {
			return x.first < y.first;
		});
		ll y = ity - a.begin();
		ll count = wm.rangefreq(x, y, l[i], r[i]);
		ll val = r[i]-l[i]-count;
		ans[i] = val;
	}	
	rep(i,Q)cout << ans[i] << '\n';
}

// https://atcoder.jp/contests/abc174/tasks/abc174_f
signed main() {
	solve();
	return 0;
}


Measured memory_bytes: 45896