use proconio::input;
use std::collections::HashMap;
fn main () {
    input! {
        n: u64,
        q: u64,
        mut a: [u64; n],
    }
    let acopy = a.clone();
    a.sort_by(|&a, &b| b.cmp(&a));
    a.dedup();
    let d =  a.iter()
        .enumerate()
        .map(|(i, &x)| {
            (x, i as u64)
        })
        .collect::<HashMap<u64, u64>>();
    //println!("{:?}", d);
    let mut count : Vec<u64> = vec![0; d.len()];
    for &v in &acopy {
        let l = *d.get(&v).unwrap();
        count[l as usize] += 1;
    }
    let count: Vec<u64> = count.iter()
        .scan(0, |sum, &x| {
            *sum += x;
            Some(*sum)
        })
        .collect();
    //println!("{:?}", count);
    for _ in 0..q {
        input! {
            x: u64, 
            y: u64,
        }
        let x = acopy[(x-1) as usize];
        let y = acopy[(y-1) as usize];
        //println!("x: {}, y: {}", x, y);
        let x = *d.get(&x).unwrap();
        let y = *d.get(&y).unwrap();
        //println!("x: {}, y: {}", x, y);
        println!("{}", 
            if y == 0 || count[(y-1) as usize] < count[x as usize]{0}
            else {count[(y-1) as usize] - count[x as usize]});
    }
}