use proconio::{input, marker::Usize1};
use std::collections::*;

fn main() {
	input! {
		N: usize, Q: usize,
		A: [usize; N],
		queries: [(Usize1, usize, usize); Q],
	}
	
	let mut by_divisor = HashMap::<usize, Vec<_>>::new();
	for i in 0 .. N {
		each_divisor(A[i], |d| by_divisor.entry(d).or_default().push(i) );
	}
	
	for &(l, r, k) in &queries {
		if let Some(indices) = by_divisor.get(&k) {
			let l = indices.binary_search(&l).unwrap_or_else(|l| l );
			let r = indices.binary_search(&r).unwrap_or_else(|r| r );
			println!("{}", r - l);
		} else {
			println!("0");
		}
	}
}

fn each_divisor(n: usize, mut f: impl FnMut(usize)) {
	let mut d = 1;
	while d * d < n {
		if n % d == 0 {
			f(d);
			f(n / d);
		}
		d += 1;
	}
	if d * d == n {
		f(d);
	}
}