{-# OPTIONS_GHC -O2 #-}
{-# LANGUAGE BangPatterns          #-}
{-# LANGUAGE CPP                   #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE OverloadedStrings     #-}
{-# LANGUAGE RecordWildCards       #-}
{-# LANGUAGE TupleSections         #-}
{-# LANGUAGE TypeFamilies          #-}

import           Control.Applicative
import           Control.Monad
import           Control.Monad.Primitive
import           Control.Monad.ST
import           Control.Monad.State.Strict
import           Data.Bool
import qualified Data.ByteString.Char8       as B
import qualified Data.ByteString.Unsafe      as B
import           Data.Char
import qualified Data.Foldable               as F
import           Data.Function
import qualified Data.IntMap.Strict          as IM
import qualified Data.IntSet                 as IS
import           Data.List
import qualified Data.Map.Strict             as M
import           Data.Monoid
import           Data.Ord
import           Data.Primitive.MutVar
import qualified Data.Set                    as S
import           Data.Tuple
import qualified Data.Vector                 as V
import qualified Data.Vector.Generic         as G
import qualified Data.Vector.Generic.Mutable as GM
import qualified Data.Vector.Unboxed         as U
import qualified Data.Vector.Unboxed.Mutable as UM
import           Debug.Trace
import           Foreign                     hiding (void)
import           Unsafe.Coerce

main :: IO ()
main = do
    [a, b, q] <- map read.words <$> getLine :: IO [Int]
    sstsxs <- U.unfoldrN (a + b + q) (B.readInt.B.dropWhile isSpace) <$> B.getContents
    let (ss, tsxs) = U.splitAt a sstsxs
    let (ts, xs) = U.splitAt b tsxs
    putStr.unlines.map show.U.toList $ solve ss ts xs

solve :: U.Vector Int -> U.Vector Int -> U.Vector Int -> U.Vector Int
solve ss ts xs = U.map f xs
  where
    f x = minimum $ s2t x ++ t2s x
    s2t x = do
        Just !si <- [prevIx x ss, nextIx x ss]
        let !s = ss U.! si
        Just !ti <- [prevIx s ts, nextIx s ts]
        let !t = ts U.! ti
        return $! abs (s - x) + abs (t - s)
    t2s x = do
        Just ti <- [prevIx x ts, nextIx x ts]
        let t = ts U.! ti
        Just si <- [prevIx t ss, nextIx t ss]
        let s = ss U.! si
        return $! abs (t - x) + abs (s - t)

prevIx :: Int -> U.Vector Int -> Maybe Int
prevIx x xs
    | x < U.head xs = Nothing
    | otherwise = Just $ upperBound 0 (U.length xs - 1) (\i -> xs U.! i <= x)

nextIx :: Int -> U.Vector Int -> Maybe Int
nextIx x xs
    | U.last xs < x = Nothing
    | otherwise = Just $ lowerBound 0 (U.length xs - 1) (\i -> x <= xs U.! i)

-------------------------------------------------------------------------------
lowerBound :: (Integral i) => i -> i -> (i -> Bool) -> i
lowerBound low high p = go low high
  where
    go !low !high
        | high <= low = high
        | p mid       = go low       mid
        | otherwise   = go (mid + 1) high
      where
        h = toInteger high
        l = toInteger low
        mid = fromIntegral $ l + div (h - l) 2
{-# INLINE lowerBound #-}

upperBound :: (Integral i) => i -> i -> (i -> Bool) -> i
upperBound low high p
    | p high = high
    | otherwise = lowerBound low high (not.p) - 1
{-# INLINE upperBound #-}


Measured memory_bytes: 11984