use proconio::*;
use proconio::marker::*;

pub trait MoOperator {
    type Value;
    type Query;
    type Answer;
    fn init(&mut self);
    fn insert(&mut self, v: &Self::Value);
    fn snap(&mut self);
    fn rollback(&mut self, v: &Self::Value);
    fn answer(&mut self, q: Self::Query) -> Self::Answer;
}

struct MoSolver<S: MoOperator> {
    size: usize,
    query: Vec<(usize, usize, S::Query)>,
}

impl<S: MoOperator> MoSolver<S> {
    fn new(size: usize) -> Self {
        MoSolver {
            size: size,
            query: vec![],
        }
    }
    fn add(&mut self, l: usize, r: usize, q: S::Query) {
        assert!(l < r && r <= self.size);
        self.query.push((l, r, q));
    }
    fn solve(&mut self, mut state: S, array: &[S::Value], answer: &mut [S::Answer]) {
        assert!(self.size <= array.len() && self.query.len() <= answer.len());
        if self.query.is_empty() {
            return;
        }
        let size = self.size;
        let batch = (size as f64 / (self.query.len() as f64).sqrt()).ceil() as usize;
        let mut q = vec![];
        std::mem::swap(&mut q, &mut self.query);
        let mut query = (0..(size / batch)).map(|_| vec![]).collect::<Vec<_>>();
        state.init();
        state.snap();
        for (i, (l, r, op)) in q.into_iter().enumerate() {
            if r - l <= batch {
                for v in array[l..r].iter() {
                    state.insert(v);
                }
                answer[i] = state.answer(op);
                for v in array[l..r].iter().rev() {
                    state.rollback(v);
                }
            } else {
                query[l / batch].push((r, l, i, op));
            }
        }
        for (i, mut query) in query.into_iter().enumerate() {
            state.init();
            query.sort_unstable_by_key(|p| p.0);
            let mid = (i + 1) * batch;
            let mut t = mid;
            for (r, l, k, op) in query.into_iter() {
                for v in array[t..r].iter() {
                    state.insert(v);
                }
                t = r;
                state.snap();
                for v in array[l..mid].iter().rev() {
                    state.insert(v);
                }
                answer[k] = state.answer(op);
                for v in array[l..mid].iter() {
                    state.rollback(v);
                }
            }
        }
    }
}

struct State {
    elem: Vec<usize>,
    memo: Vec<usize>,
    cnt: usize,
}

impl MoOperator for State {
    type Value = usize;
    type Query = ();
    type Answer = usize;
    fn init(&mut self) {
        self.elem.iter_mut().for_each(|e| *e = 0);
        self.memo.clear();
        self.cnt = 0;
    }
    fn insert(&mut self, x: &Self::Value) {
        let q = *x / 64;
        let r = *x % 64;
        let e = &mut self.elem[q];
        if *e >> r & 1 == 0 {
            *e |= 1 << r;
            self.cnt += 1;
            self.memo.push(*x);
        }
    }
    fn snap(&mut self) {
        self.memo.clear();
    }
    fn rollback(&mut self, _x: &Self::Value) {
        self.cnt -= self.memo.len();
        for &x in self.memo.iter() {
            self.elem[x / 64] ^= 1 << (x % 64);
        }
        self.memo.clear();
    }
    fn answer(&mut self, _q: Self::Query) -> usize {
        self.cnt
    }
}

#[fastout]
fn run() {
    input! {
        n: usize,
        q: usize,
        c: [Usize1; n],
        ask: [(Usize1, usize); q],
    }
    let mut solver = MoSolver::new(n);
    for (l, r) in ask {
        solver.add(l, r, ());
    }
    let state = State {
        elem: vec![0; n / 64 + 1],
        memo: vec![],
        cnt: 0,
    };
    let mut ans = vec![0; q];
    solver.solve(state, &c, &mut ans);
    for a in ans {
        println!("{}", a);
    }
}

fn main() {
    run();
}


Measured memory_bytes: 44576