#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <type_traits>
#include <cmath>
#include <cassert>
#include <cstdio>

using namespace std;
using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector< int >;
using VVI = vector< vector< int > >;
using VS = vector< string >;
using ISS = istringstream;
using OSS = ostringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< vector< T > >;
template < typename T = int > using LIM = numeric_limits< T >;
template < typename T = int > using OSI = ostream_iterator< T >;

template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i ) << v[i]; } return s; }

void in_impl(){};
template < typename T, typename... TS > void in_impl( T &head, TS &... tail ){ cin >> head; in_impl( tail ... ); }
#define IN( T, ... ) T __VA_ARGS__; in_impl( __VA_ARGS__ );

template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; }
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); }

#define NUMBERED( name, number ) NUMBERED2( name, number )
#define NUMBERED2( name, number ) name ## _ ## number
#define REP1( n ) REP2( NUMBERED( REP_COUNTER, __LINE__ ), n )
#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2, REP1 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &&e : c )
#define ALL( c ) begin( c ), end( c )
#define AALL( a ) ( remove_all_extents< decltype( a ) >::type * )a, ( remove_all_extents< decltype( a ) >::type * )a + sizeof( a ) / sizeof( remove_all_extents< decltype( a ) >::type )

#define SZ( v ) ( (int)( v ).size() )
#define EXISTS( c, e ) ( ( c ).find( e ) != ( c ).end() )

template < typename T > inline bool chmin( T &a, const T &b ){ if ( b < a ) { a = b; return true; } return false; }
template < typename T > inline bool chmax( T &a, const T &b ){ if ( a < b ) { a = b; return true; } return false; }

#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define MP make_pair
#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

//     Λ   Λ＿_
//  ／(*ﾟーﾟ)／＼
// ／| ￣U U￣|＼／
//   |      |／

// Fenwick Tree ( Binary Indexed Tree )
template < typename T >
class FenwickTree 
{
private:
	const int N;
	std::vector< T > data;

public:
	FenwickTree( const int n ) : N( n ), data( N + 1, 0 ) {}

	T sum( int i ) const
	{
		++i;
		T res = 0;
		while ( 0 < i )
		{
			res += data[i];
			i -= i & -i;
		}
		return res;
	}

	T sum( const int l, const int r ) const
	{
		return l ? sum( r - 1 ) - sum( l - 1 ) : sum( r - 1 );
	}

	void add( int i, const T x )
	{
		++i;
		while ( i <= N )
		{
			data[i] += x;
			i += i & -i;
		}
		return;
	}

	void change( const int i, const T x )
	{
		add( i, x - ( sum( i ) - ( i ? sum( i - 1 ) : 0 ) ) );
		return;
	}

	int lower_bound( T v ) const
	{
		int x = 0;
		for ( int k = 1 << ( 31 - __builtin_clz( N ) ); k; k >>= 1 )
		{
			if ( x + k <= N && data[ x + k ] < v )
			{
				x += k;
				v -= data[x];
			}
		}
		return x;
	}
};
// FenwickTree( array size )
// int sum( 0-indexed pos )
// int sum( [ l, r )
// int add( pos, value )
// int change( pos, value )
// int lower_bound( value )

int main()
{
	cin.tie( nullptr );
	ios::sync_with_stdio( false );
	cout << setprecision( 12 ) << fixed;

	IN( int, N, Q );
	VI C( N );
	cin >> C;

	VI L( Q ), R( Q );
	REP( i, Q )
	{
		cin >> L[i] >> R[i];
		--L[i];
	}

	using Segment = tuple< int, int, int >;
	// ( R, type or ID, L )

	VT< Segment > segments;
	{
		map< int, VI > appearances;
		REP( i, N )
		{
			appearances[ C[i] ].PB( i );
		}
		FOR( p, appearances )
		{
			const auto &row = p.snd;
			REP( i, SZ( row ) - 1 )
			{
				segments.EB( row[ i + 1 ] + 1, -1, row[i] );
			}
		}
	}
	REP( i, Q )
	{
		segments.EB( R[i], i, L[i] );
	}
	sort( ALL( segments ) );

	FenwickTree< int > fenwick( N );
	VI res( Q );
	FOR( segment, segments )
	{
		const int r = get< 0 >( segment );
		const int t = get< 1 >( segment );
		const int l = get< 2 >( segment );

		if ( t == -1 )
		{
			fenwick.add( l, 1 );
		}
		else
		{
			res[t] = ( r - l ) - fenwick.sum( l, r );
		}
	}

	copy( ALL( res ), OSI< int >( cout, "\n" ) );
	cout << flush;

	return 0;
}

Measured memory_bytes: 64380