Problem:
Score : 600 points

Problem Statement

We have N colored balls arranged in a row from left to right; the color of the i-th ball from the left is c_i.

You are given Q queries. The i-th query is as follows: how many different colors do the l_i-th through r_i-th balls from the left have?

Constraints

1\leq N,Q \leq 5 \times 10^5

1\leq c_i \leq N

1\leq l_i \leq r_i \leq N

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N Q
c_1 c_2 \cdots c_N
l_1 r_1
l_2 r_2
:
l_Q r_Q

Output

Print Q lines. The i-th line should contain the response to the i-th query.

Sample Input 1

4 3
1 2 1 3
1 3
2 4
3 3

Sample Output 1

2
3
1

The 1-st, 2-nd, and 3-rd balls from the left have the colors 1, 2, and 1 - two different colors.

The 2-st, 3-rd, and 4-th balls from the left have the colors 2, 1, and 3 - three different colors.

The 3-rd ball from the left has the color 1 - just one color.

Sample Input 2

10 10
2 5 6 5 2 1 7 9 7 2
5 5
2 4
6 7
2 2
7 8
7 9
1 8
6 9
8 10
6 8

Sample Output 2

1
2
2
1
2
2
6
3
3
3

Solution in Rust (1.42.0) (judge verdict: Time Limit Exceeded)

#![allow(unused_imports)]
#![allow(non_snake_case)]
use std::cmp::*;
use std::collections::*;
use std::io::Write;

#[allow(unused_macros)]
macro_rules! debug {
    ($($e:expr),*) => {
        #[cfg(debug_assertions)]
        $({
            let (e, mut err) = (stringify!($e), std::io::stderr());
            writeln!(err, "{} = {:?}", e, $e).unwrap()
        })*
    };
}

#[derive(Clone)]
struct SegTree {
    n: usize,
    dat: Vec<HashSet<usize>>,
}

impl SegTree {
    fn new(n: usize) -> SegTree {
        let mut m = 1;
        // For simplicity, we use 2 ** n sized SegTree.
        while m < n {
            m *= 2;
        }
        SegTree {
            n: m,
            dat: vec![HashSet::<usize>::new(); 2 * m - 1],
        }
    }

    // dat[k] = a;
    fn update(&mut self, k: usize, a: usize) {
        let mut k = k;
        k += self.n - 1;
        self.dat[k].insert(a);
        while k > 0 {
            k = (k - 1) / 2;
            self.dat[k].insert(a);
        }
    }

    // [a, b)
    fn query(&self, a: usize, b: usize) -> HashSet<usize> {
        self.query_inner(a, b, 0, 0, self.n)
    }

    fn query_inner(&self, a: usize, b: usize, k: usize, l: usize, r: usize) -> HashSet<usize> {
        if r <= a || b <= l {
            return HashSet::new();
        }
        if a <= l && r <= b {
            return self.dat[k].clone();
        }

        let mut vl = self.query_inner(a, b, k * 2 + 1, l, (l + r) / 2);
        let mut vr = self.query_inner(a, b, k * 2 + 2, (l + r) / 2, r);
        if vl.len() > vr.len() {
            vl.extend(vr.into_iter());
            vl
        } else {
            vr.extend(vl.into_iter());
            vr
        }
    }
}

fn main() {
    let v = read_vec::<usize>();
    let (n, q) = (v[0], v[1]);
    let c = read_vec::<usize>();
    let mut seg = SegTree::new(n);
    for i in 0..n {
        seg.update(i, c[i]);
    }
    for _ in 0..q {
        let v = read_vec::<usize>();
        let (l, r) = (v[0] - 1, v[1] - 1);
        let ans = seg.query(l, r + 1).len();
        println!("{}", ans);
    }
}

fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}