import java.io.BufferedReader
import java.io.InputStream
import java.io.InputStreamReader
import java.lang.AssertionError
import java.util.*
import kotlin.math.abs
import kotlin.math.max
import kotlin.math.min

val MOD = 1_000_000_007

class Solver(stream: InputStream, private val out: java.io.PrintWriter) {
  private val reader = BufferedReader(InputStreamReader(stream), 32768)

  private val N = ni()
  private val X = nal(N)
  private val Q = ni()
  private val q = kotlin.math.sqrt(Q.toDouble()).toInt()

  inner class Query(val id: Int, val l: Int, val r: Int, val x: Long) : Comparable<Query> {
    override fun compareTo(other: Query): Int {
      if (l/q != other.l/q) return (l/q).compareTo(other.l/q)
      return r.compareTo(other.r)
    }
  }

  // multisetの代わり
  private val cnt = TreeSet<Long>()
  private inline fun incr(i: Long) {cnt.add(i)}
  private inline fun decr(i: Long) {cnt.remove(i) }

  fun solve() {
    val queries = Array(Q) {
      val l = ni() - 1
      val r = ni()
      val x = nl()
      Query(it, l, r, x)
    }
    queries.sort()
    var l = 0
    var r = 0
    val ans = LongArray(Q)
    val INF = 1e18.toLong() + 100
    for (q in queries) {
      while (q.l < l) incr(X[--l])
      while (q.r > r) incr(X[r++])
      while (q.l > l) decr(X[l++])
      while (q.r < r) decr(X[--r])
      debug{"${q.id} cnt:$cnt"}
      val ans1 = abs((cnt.lower(q.x + 1L) ?: INF) - q.x)
      val ans2 = abs((cnt.higher(q.x - 1L) ?: INF) - q.x)
      ans[q.id] = min(ans1, ans2)
    }
    for (i in ans) {
      out.println(i)
    }
  }













































  private val isDebug = try {
    // なんか本番でエラーでる
    System.getenv("MY_DEBUG") != null
  } catch (t: Throwable) {
    false
  }

  private var tokenizer: StringTokenizer? = null
  private fun next(): String {
    while (tokenizer == null || !tokenizer!!.hasMoreTokens()) {
      tokenizer = StringTokenizer(reader.readLine())
    }
    return tokenizer!!.nextToken()
  }

  private fun ni() = next().toInt()
  private fun nl() = next().toLong()
  private fun ns() = next()
  private fun na(n: Int, offset: Int = 0): IntArray {
    return IntArray(n) { ni() + offset }
  }
  private fun nal(n: Int, offset: Int = 0): LongArray {
    val res = LongArray(n)
    for (i in 0 until n) {
      res[i] = nl() + offset
    }
    return res
  }

  private fun na2(n: Int, offset: Int = 0): Array<IntArray> {
    val a  = Array(2){IntArray(n)}
    for (i in 0 until n) {
      for (e in a) {
        e[i] = ni() + offset
      }
    }
    return a
  }

  private inline fun debug(msg: () -> String) {
    if (isDebug) System.err.println(msg())
  }

  private inline fun debug(a: LongArray) {
    debug { a.joinToString(" ") }
  }

  private inline fun debug(a: IntArray) {
    debug { a.joinToString(" ") }
  }

  private inline fun debug(a: BooleanArray) {
    debug { toString(a) }
  }

  private inline fun toString(a: BooleanArray) = run{a.map { if (it) 1 else 0 }.joinToString("")}

  private inline fun debugDim(A: Array<LongArray>) {
    if (isDebug) {
      for (a in A) {
        debug(a)
      }
    }
  }
  private inline fun debugDim(A: Array<IntArray>) {
    if (isDebug) {
      for (a in A) {
        debug(a)
      }
    }
  }
  private inline fun debugDim(A: Array<BooleanArray>) {
    if (isDebug) {
      for (a in A) {
        debug(a)
      }
    }
  }

  /**
   * 勝手にimport消されるのを防ぎたい
   */
  private fun hoge() {
    min(1, 2)
    max(1, 2)
    abs(-10)
  }

  private inline fun assert(b: Boolean) = run{if (!b) throw AssertionError()}
}

fun main() {
  val out = java.io.PrintWriter(System.out)
  Solver(System.`in`, out).solve()
  out.flush()
}