using System;
using System.Text;
using System.Linq;
using System.Collections;
using System.Collections.Generic;
using static System.Console;
using static System.Math;
using System.IO;

namespace AtCoder
{
    class Program
    {
        static void Main(string[] args)
        {
            var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
            Console.SetOut(sw);
            new Program().Solve(new ConsoleInput(Console.In, ' '));
            Console.Out.Flush();
#if DEBUG
            ReadLine();
#endif
        }

        void Solve(ConsoleInput cin)
        {
            int a = cin.ReadInt;
            int b = cin.ReadInt;
            int q = cin.ReadInt;

            long[] s = new long[a + 2];
            long[] t = new long[b + 2];
            s[0] = t[0] = long.MinValue / 100;
            s[a + 1] = t[b + 1] = long.MaxValue / 100;
            for (int i = 1; i <= a; i++) s[i] = cin.ReadLong;
            for (int i = 1; i <= b; i++) t[i] = cin.ReadLong;

            long[] x = cin.ReadLongArray(q);

            for (int i = 0; i < q; i++)
            {
                int sIndex = BinarySearch(s, x[i]);
                int tIndex = BinarySearch(t, x[i]);

                long[] ans = { long.MaxValue, long.MaxValue, long.MaxValue, long.MaxValue };

                //rr
                ans[0] = Max(Abs(s[sIndex + 1] - x[i]), Abs(t[tIndex + 1] - x[i]));

                //rl
                ans[1] = Min(2 * Abs(s[sIndex + 1] - x[i]) + Abs(t[tIndex] - x[i]), 2 * Abs(t[tIndex + 1] - x[i]) + Abs(s[sIndex] - x[i]));

                //lr
                ans[2] = Min(2 * Abs(s[sIndex] - x[i]) + Abs(t[tIndex + 1] - x[i]), 2 * Abs(t[tIndex] - x[i]) + Abs(s[sIndex + 1] - x[i]));

                //ll
                ans[3] = Max(Abs(s[sIndex] - x[i]), Abs(t[tIndex] - x[i]));

                Console.WriteLine(ans.Min());
            }
        }

        static int BinarySearch(long[] array, long val)
        {
            int bottom = 0;
            int top = array.Length;
            while (bottom + 1 < top)
            {
                int mid = (bottom + top) / 2;
                if (array[mid] <= val)
                {
                    bottom = mid;
                }
                else
                {
                    top = mid;
                }
            }
            if (bottom == 0 && val < array[bottom]) return -1;
            else return bottom;
        }


        class ConsoleInput
        {
            private readonly System.IO.TextReader _stream;
            private char _separator = ' ';
            private Queue<string> inputStream;

            public ConsoleInput(System.IO.TextReader stream, char separator = ' ')
            {
                this._separator = separator;
                this._stream = stream;
                inputStream = new Queue<string>();
            }

            public string Read
            {
                get
                {
                    if (inputStream.Count != 0) return inputStream.Dequeue();
                    string[] tmp = _stream.ReadLine().Split(_separator);
                    for (int i = 0; i < tmp.Length; ++i)
                        inputStream.Enqueue(tmp[i]);
                    return inputStream.Dequeue();
                }
            }

            public string ReadLine { get { return _stream.ReadLine(); } }
            public int ReadInt { get { return int.Parse(Read); } }
            public long ReadLong { get { return long.Parse(Read); } }
            public double ReadDouble { get { return double.Parse(Read); } }
            public string[] ReadStrArray(long N) { var ret = new string[N]; for (long i = 0; i < N; ++i) ret[i] = Read; return ret; }
            public int[] ReadIntArray(long N) { var ret = new int[N]; for (long i = 0; i < N; ++i) ret[i] = ReadInt; return ret; }
            public long[] ReadLongArray(long N) { var ret = new long[N]; for (long i = 0; i < N; ++i) ret[i] = ReadLong; return ret; }
        }
    }
}

Measured memory_bytes: 20252