// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

fn run() {
    input! {
        n: usize,
        x: [u32; n],
        q: usize,
        ask: [(usize1, usize, u32); q],
    }
    let size = n.next_power_of_two();
    let mut seg = vec![vec![]; 2 * size];
    for (seg, x) in seg[size..].iter_mut().zip(x.into_iter()) {
        seg.push(x);
    }
    for i in (1..size).rev() {
        let mut a = Vec::with_capacity(seg[2 * i].len() + seg[2 * i + 1].len());
        a.extend_from_slice(&seg[2 * i]);
        a.extend_from_slice(&seg[2 * i + 1]);
        a.sort();
        a.dedup();
        seg[i] = a;
    }
    let calc = |a: &[u32], x: u32| -> u32 {
        let y = a.binary_search_by_key(&(x, 0), |a| (*a, 1)).unwrap_err();
        let mut ans = std::u32::MAX;
        a.get(y).map(|a| ans = ans.min(*a - x));
        a.get(y - 1).map(|a| ans = ans.min(x - *a));
        ans
    };
    let find = |mut l: usize, mut r: usize, x: u32| -> u32 {
        l += size;
        r += size;
        let mut ans = std::u32::MAX;
        while l < r {
            if l & 1 == 1 {
                ans = ans.min(calc(&seg[l], x));
                l += 1;
            }
            if r & 1 == 1 {
                r -= 1;
                ans = ans.min(calc(&seg[r], x));
            }
            l >>= 1;
            r >>= 1;
        }
        ans
    };
    use std::io::Write;
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    for (l, r, x) in ask {
        writeln!(out, "{}", find(l, r, x)).ok();
    }
}

fn main() {
    run();
}