{-# OPTIONS_GHC -O2 #-}
{-# LANGUAGE BangPatterns, BinaryLiterals, CPP, DerivingStrategies  #-}
{-# LANGUAGE DerivingVia, FlexibleContexts, FlexibleInstances       #-}
{-# LANGUAGE GeneralizedNewtypeDeriving, KindSignatures, LambdaCase #-}
{-# LANGUAGE MagicHash, MultiParamTypeClasses, MultiWayIf           #-}
{-# LANGUAGE NumericUnderscores, OverloadedStrings, PatternSynonyms #-}
{-# LANGUAGE RankNTypes, RecordWildCards, ScopedTypeVariables       #-}
{-# LANGUAGE StandaloneDeriving, TupleSections, TypeApplications    #-}
{-# LANGUAGE TypeFamilies, TypeInType, UnboxedTuples, ViewPatterns  #-}

import           Control.Applicative
import           Control.Exception
import           Control.Monad
import           Control.Monad.Primitive
import           Control.Monad.Reader
import           Control.Monad.ST
import           Control.Monad.State.Strict
import           Data.Bifunctor
import           Data.Bool
import qualified Data.ByteString                   as B
import qualified Data.ByteString.Builder           as B
import qualified Data.ByteString.Char8             as C
import qualified Data.ByteString.Internal          as B
import qualified Data.ByteString.Unsafe            as B
import           Data.Char
import qualified Data.Foldable                     as F
import           Data.Function
import           Data.Functor.Identity
import qualified Data.IntMap.Strict                as IM
import qualified Data.IntSet                       as IS
import qualified Data.List                         as L
import qualified Data.Map.Strict                   as M
import           Data.Monoid
import           Data.Ord
import           Data.Primitive
import           Data.Proxy
import           Data.Ratio
import           Data.Semigroup
import qualified Data.Set                          as S
import           Data.Tuple
import qualified Data.Vector                       as V
import qualified Data.Vector.Algorithms.Intro      as Intro
import qualified Data.Vector.Fusion.Stream.Monadic as MS
import qualified Data.Vector.Fusion.Bundle.Monadic as MB
import           Data.Vector.Fusion.Util
import qualified Data.Vector.Generic               as G
import qualified Data.Vector.Generic.Mutable       as GM
import qualified Data.Vector.Mutable               as VM
import qualified Data.Vector.Primitive             as P
import qualified Data.Vector.Primitive.Mutable     as PM
import qualified Data.Vector.Unboxed               as U
import qualified Data.Vector.Unboxed.Mutable       as UM
import           Debug.Trace
import           Foreign                           hiding (void)
import           GHC.Exts
import           GHC.TypeLits
import qualified System.IO                         as IO
import           Unsafe.Coerce

#define MOD 1000000007

main :: IO ()
main = do
    [n, q] <- map read.words <$> getLine
    cs <- U.unfoldrN n (runParser int) <$> C.getLine
    qs <- U.unfoldrN q (runParser $ (,) <$> int1 <*> int1) <$> C.getContents
    B.hPutBuilder IO.stdout . U.foldr (\x b -> B.intDec x <> B.char7 '\n' <> b) mempty
        $ solve n q cs qs

solve :: Int -> Int -> U.Vector Int -> U.Vector (Int, Int) -> U.Vector Int
solve n q arr query = U.create $ do
    result <- UM.unsafeNew q
    freq <- UM.replicate (n + 1) (0 :: Int)
    score <- UM.replicate 1 0

    UM.write score 0 1
    UM.write freq (U.head arr) 1

    U.foldM' ( \(MoS l0 r0) qi -> do
        let add = \i -> do
                let x = U.unsafeIndex arr i
                f <- UM.unsafeRead freq x
                when (f == 0) $ do
                    UM.unsafeModify score (+1) 0
                UM.unsafeWrite freq x (f + 1)
            {-# INLINE add #-}
        let remove = \i -> do
                let x = U.unsafeIndex arr i
                f <- UM.unsafeRead freq x
                when (f == 1) $ do
                    UM.unsafeModify score (subtract 1) 0
                UM.unsafeWrite freq x (f - 1)
            {-# INLINE remove #-}
        let (l, r) = U.unsafeIndex query qi
        F.traverse_ add [r0+1..r]
        F.traverse_ (remove.negate) [-r0.. -(r+1)] -- [r0, r0-1..r+1]
        F.traverse_ (add.negate)[1-l0..(-l)] -- [l0-1, l0-2..l]
        F.traverse_ remove [l0..l-1]
        UM.unsafeRead score 0 >>= UM.unsafeWrite result qi
        return $! MoS l r
        ) (MoS 0 0) (U.map moDecode $ moSort query)
    return result

moBlockSize :: Int
moBlockSize = 450
{-# INLINE moBlockSize #-}

moSort :: U.Vector (Int, Int) -> U.Vector Word64
moSort lrs = radixSort64 $ U.imap (\i (l, r) -> moEncode l r i) lrs

moEncode :: Int -> Int -> Int -> Word64
moEncode l r qi = unsafeShiftL l' 40 .|. unsafeShiftL r' 20 .|. fromIntegral qi
  where
    l' = fromIntegral $ quot l moBlockSize
    r' | testBit l' 0 = 0xfffff - fromIntegral r
       | otherwise = fromIntegral r
{-# INLINE moEncode #-}

moDecode :: Word64 -> Int
moDecode bits = fromIntegral $ bits .&. 0xfffff
{-# INLINE moDecode #-}

data MoState = MoS
    { moL :: {-# UNPACK #-} !Int
    , moR :: {-# UNPACK #-} !Int
    } deriving (Eq, Ord)

radixSort64 :: U.Vector Word64 -> U.Vector Word64
radixSort64 v = F.foldl' step v [0, 16, 32, 48]
  where
    mask k x = fromIntegral $ unsafeShiftR x k .&. 0xffff
    step v k = U.create $ do
        pref <- U.unsafeThaw
            . U.prescanl' (+) 0
            . U.unsafeAccumulate (+) (U.replicate 0x10000 0)
            $ U.map (flip (,) 1 . mask k) v
        res <- UM.unsafeNew $ U.length v
        U.forM_ v $ \x -> do
            let !masked = mask k x
            i <- UM.unsafeRead pref masked
            UM.unsafeWrite pref masked $ i + 1
            UM.unsafeWrite res i x
        return res
{-# INLINE radixSort64 #-}
-------------------------------------------------------------------------------
-- Utils
-------------------------------------------------------------------------------
rep :: Monad m => Int -> (Int -> m ()) -> m ()
rep !n = U.forM_ $ U.generate n id
{-# INLINE rep #-}
rev :: Monad m => Int -> (Int -> m ()) -> m ()
rev !n = U.forM_ $ U.iterateN n (subtract 1) (n - 1)
{-# INLINE rev #-}
infixl 8 `shiftRL`, `unsafeShiftRL`
shiftRL = unsafeShiftRL
{-# INLINE shiftRL #-}
unsafeShiftRL (I# x#) (I# i#) = I# (uncheckedIShiftRL# x# i#)
{-# INLINE unsafeShiftRL #-}
type Parser a = StateT C.ByteString Maybe a
runParser :: Parser a -> C.ByteString -> Maybe (a, C.ByteString)
runParser = runStateT
{-# INLINE runParser #-}
int :: Parser Int
int = coerce $ C.readInt . C.dropWhile isSpace
{-# INLINE int #-}
int1 :: Parser Int
int1 = fmap (subtract 1) int
{-# INLINE int1 #-}
char :: Parser Char
char = coerce C.uncons
{-# INLINE char #-}
byte :: Parser Word8
byte = coerce B.uncons
{-# INLINE byte #-}
