using System;
using System.Collections.Generic;
using System.Linq;
namespace Practice
{
    class Program
    {
        static void Main(string[] args)
        {
            Solve();
        }
        private const int MOD = 1000000007;

        private static long[] s;
        private static long[] t;
        static void Solve()
        {
            var o = ReadAndParseIntArr();
            var a = o[0];
            var b = o[1];
            var q = o[2];
            s = new long[a];
            for(int i=0;i<a;++i)
            {
                s[i] = ReadAndParseLong();
            }
            t = new long[b];
            for(int i=0;i<b;++i)
            {
                t[i] = ReadAndParseLong();
            }
            var x = new long[q];
            for (int i=0;i<q;++i)
            {
                x[i] = ReadAndParseLong();
                
            }
            foreach(var xi in x)
            {
                long ans = long.MaxValue;
                // S
                int idxS = UpperBound(s, xi);
                ans = Math.Min(MinDistStoT(idxS - 1, xi), MinDistStoT(idxS, xi));

                // T
                int idxT = UpperBound(t, xi);
                ans = Math.Min(ans, Math.Min( MinDistTtoS(idxT - 1, xi), MinDistTtoS(idxT, xi)));
                Console.WriteLine(ans);
            }
        }
        private const long MaxDist = long.MaxValue / 10;
        
        private static long MinDistStoT(int idxS, long x)
        {
            if( idxS < 0 || s.Length <= idxS) { return MaxDist; }
            
            long pos = s[idxS];
            long ans = Math.Abs(x - pos);
            int idxT = UpperBound(t, pos);
            ans += Math.Min(MinDistT(idxT - 1, pos), MinDistT(idxT, pos));
            return ans;
        }
        private static long MinDistT(int idxT, long y)
        {
            if (idxT < 0 || t.Length <= idxT) { return MaxDist; }
            long pos = t[idxT];
            return Math.Abs(pos - y);
        }
        private static long MinDistTtoS(int idxT, long x)
        {
            if (idxT < 0 || t.Length <= idxT) { return MaxDist; }

            long pos = t[idxT];
            long ans = Math.Abs(x - pos);
            int idxS = UpperBound(s, pos);
            ans += Math.Min(MinDistS(idxS - 1, pos), MinDistS(idxS, pos));
            return ans;
        }
        private static long MinDistS(int idxS, long x)
        {
            if (idxS < 0 || s.Length <= idxS) { return MaxDist; }
            return Math.Abs(s[idxS] -x);
        }


        #region よく使う便利関数
        private static bool isPrime(long x)
        {
            if (x == 2) { return true; }
            if (x < 2 || x % 2 == 0) { return false; }
            long i = 3;
            while (i * i <= x)
            {
                if (x % i == 0) { return false; }
                i = i + 2;
            }
            return true;
        }
        private static long lcm(long x, long y)
        {
            return x / gcd(x, y) * y;
        }
        private static long gcd(long x, long y)
        {
            return y > 0 ? gcd(y, x % y) : x;
        }
        private static long pow(long x, long n)
        {
            if (n == 0) { return 1; }
            long res = pow(x * x % MOD, n / 2);
            if (n % 2 == 1)
            {
                res = res * x % MOD;
            }
            return res;
        }
        private static int ReadAndParseInt()
        {
            return int.Parse(Console.ReadLine());
        }
        private static int[] ReadAndParseIntArr()
        {
            return Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);
        }
        private static long ReadAndParseLong()
        {
            return long.Parse(Console.ReadLine());
        }
        private static long[] ReadAndParseLongArr()
        {
            return Array.ConvertAll(Console.ReadLine().Split(' '), long.Parse);
        }

        /// <summary>
        /// 指定した値以上の先頭のインデクスを返す
        /// </summary>
        /// <typeparam name="T">比較する値の型</typeparam>
        /// <param name="arr">対象の配列（※ソート済みであること）</param>
        /// <param name="start">開始インデクス [inclusive]</param>
        /// <param name="end">終了インデクス [exclusive]</param>
        /// <param name="value">検索する値</param>
        /// <param name="comparer">比較関数(インターフェイス)</param>
        /// <returns>指定した値以上の先頭のインデクス</returns>
        public static int LowerBound<T>(IReadOnlyList<T> arr, int start, int end, T value, IComparer<T> comparer)
        {
            int low = start;
            int high = end;
            int mid;
            while (low < high)
            {
                mid = ((high - low) >> 1) + low;
                if (comparer.Compare(arr[mid], value) < 0)
                    low = mid + 1;
                else
                    high = mid;
            }
            return low;
        }

        //引数省略のオーバーロード
        public static int LowerBound<T>(IReadOnlyList<T> arr, T value) where T : IComparable
        {
            return LowerBound(arr, 0, arr.Count, value, Comparer<T>.Default);
        }

        /// <summary>
        /// 指定した値より大きい先頭のインデクスを返す
        /// </summary>
        /// <typeparam name="T">比較する値の型</typeparam>
        /// <param name="arr">対象の配列（※ソート済みであること）</param>
        /// <param name="start">開始インデクス [inclusive]</param>
        /// <param name="end">終了インデクス [exclusive]</param>
        /// <param name="value">検索する値</param>
        /// <param name="comparer">比較関数(インターフェイス)</param>
        /// <returns>指定した値より大きい先頭のインデクス</returns>
        public static int UpperBound<T>(IReadOnlyList<T> arr, int start, int end, T value, IComparer<T> comparer)
        {
            int low = start;
            int high = end;
            int mid;
            while (low < high)
            {
                mid = ((high - low) >> 1) + low;
                if (comparer.Compare(arr[mid], value) <= 0)
                    low = mid + 1;
                else
                    high = mid;
            }
            return low;
        }

        //引数省略のオーバーロード
        public static int UpperBound<T>(IReadOnlyList<T> arr, T value)
        {
            return UpperBound(arr, 0, arr.Count, value, Comparer<T>.Default);
        }
        #endregion
    }
}

Measured memory_bytes: 20688