import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.Closeable;
import java.io.IOException;
import java.util.NoSuchElementException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author HBonsai
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastScanner in = new FastScanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        DLazyFaith solver = new DLazyFaith();
        solver.solve(1, in, out);
        out.close();
    }

    static class DLazyFaith {
        public void solve(int testNumber, FastScanner in, PrintWriter out) {
            final long INF = Long.MAX_VALUE / 10;
            int A = in.nextInt();
            int B = in.nextInt();
            int Q = in.nextInt();
            long[] s = new long[A + 2];
            long[] t = new long[B + 2];
            s[0] = -INF;
            for (int i = 1; i <= A; i++) {
                s[i] = in.nextLong();
            }
            s[A + 1] = INF;

            t[0] = -INF;
            for (int i = 1; i <= B; i++) {
                t[i] = in.nextLong();
            }
            t[B + 1] = INF;

            long[] x = in.nextLongArray(Q);
            for (int q = 0; q < Q; q++) {
                long ans = INF;
                int bi = ~Arrays.binarySearch(s, x[q]);
                int di = ~Arrays.binarySearch(t, x[q]);
                long[] ss = {s[bi - 1], s[bi]};
                long[] tt = {t[di - 1], t[di]};
                for (long b : ss) {
                    for (long d : tt) {
                        long candidate1 = Math.abs(x[q] - b) + Math.abs(b - d);
                        long candidate2 = Math.abs(x[q] - d) + Math.abs(b - d);
                        ans = Math.min(ans, Math.min(candidate1, candidate2));
                    }
                }
                out.println(ans);
            }
        }

    }

    static class FastScanner implements Closeable {
        private final InputStream in;
        private final byte[] buffer = new byte[1024];
        private int ptr = 0;
        private int buflen = 0;

        public FastScanner(InputStream in) {
            this.in = in;
        }

        private boolean hasNextByte() {
            if (ptr < buflen) {
                return true;
            } else {
                ptr = 0;
                try {
                    buflen = in.read(buffer);
                } catch (IOException e) {
                    e.printStackTrace();
                }
                if (buflen <= 0) {
                    return false;
                }
            }
            return true;
        }

        private int readByte() {
            if (hasNextByte()) return buffer[ptr++];
            else return -1;
        }

        private static boolean isPrintableChar(int c) {
            return 33 <= c && c <= 126;
        }

        public boolean hasNext() {
            while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
            return hasNextByte();
        }

        public long nextLong() {
            if (!hasNext()) throw new NoSuchElementException();
            long n = 0;
            boolean minus = false;
            int b = readByte();
            if (b == '-') {
                minus = true;
                b = readByte();
            }
            if (b < '0' || '9' < b) {
                throw new NumberFormatException();
            }
            while (true) {
                if ('0' <= b && b <= '9') {
                    n *= 10;
                    n += b - '0';
                } else if (b == -1 || !isPrintableChar(b)) {
                    return minus ? -n : n;
                } else {
                    throw new NumberFormatException();
                }
                b = readByte();
            }
        }

        public int nextInt() {
            long nl = nextLong();
            if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
            return (int) nl;
        }

        public long[] nextLongArray(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }

        public void close() {
            try {
                in.close();
            } catch (IOException e) {
                e.printStackTrace();
            }
        }

    }
}



Measured memory_bytes: 46688