import java.io.BufferedWriter;
import java.io.FileWriter;
import java.io.InputStream;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.math.BigDecimal;
import java.math.MathContext;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.Deque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Objects;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Random;
import java.util.Scanner;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;

import static java.util.Comparator.*;

public class Main {
    public static void main(String[] args) {
        PrintWriter out = new PrintWriter(System.out);
        Solver solver = new Solver(System.in, out);
        solver.solve();
        out.close();
    }
}
class Solver {
	Scanner sc;
	PrintWriter out;
    public Solver(InputStream in, PrintWriter out) {
    	sc = new Scanner(in);
    	this.out = out;
    }
    // ======================================================================
    final long INF = 1000000000000000000L;
    TreeSet<Long> S = new TreeSet<>();
    TreeSet<Long> T = new TreeSet<>();
    public void solve() {
    	int A = ni();
    	int B = ni();
    	int Q = ni();
    	for (int i = 0; i < A; i++)	S.add(nl());
    	for (int i = 0; i < B; i++)	T.add(nl());
    	long x, ans, wk_1, wk_2;
    	Long sl, sr, tl, tr;
    	for (int i = 0; i < Q; i++) {
			x = nl();
			sl = S.lower(x);
			sr = S.higher(x);
			tl = T.lower(x);
			tr = T.higher(x);
			ans = INF;
			if(sl == null && tl == null) {
				ans = Math.min(ans, Math.max(sr - x, tr - x));
			} else if(sr == null && tr == null) {
				ans = Math.min(ans, Math.max(x - sl, x - tl));
			} else if(sl == null) {		// tl != null && sr != null   tr ?
				wk_1 = (x - tl) * 2 + (sr - x);
				wk_2 = (x - tl) + (sr - x) * 2;
				ans = Math.min(ans, Math.min(wk_1, wk_2));
				if(tr != null) {
					ans = Math.min(ans, Math.max(sr - x, tr - x));
				}
			} else if(tl == null) {		// sl != null && tr != null   sr ?
				wk_1 = (x - sl) * 2 + (tr - x);
				wk_2 = (x - sl) + (tr - x) * 2;
				ans = Math.min(ans, Math.min(wk_1, wk_2));
				if(sr != null) {
					ans = Math.min(ans, Math.max(sr - x, tr - x));
				}
			} else if(sr == null) {		// sl != null && tr != null   tl ?
				wk_1 = (x - sl) * 2 + (tr - x);
				wk_2 = (x - sl) + (tr - x) * 2;
				ans = Math.min(ans, Math.min(wk_1, wk_2));
				if(tl != null) {
					ans = Math.min(ans, Math.max(x - sl, x - tl));
				}
			} else if(tr == null) {		// tl != null && sr != null   sl ?
				wk_1 = (x - tl) * 2 + (sr - x);
				wk_2 = (x - tl) + (sr - x) * 2;
				ans = Math.min(ans, Math.min(wk_1, wk_2));
				if(sl != null) {
					ans = Math.min(ans, Math.max(x - sl, x - tl));
				}
			} else {					// 全部　null でない
				ans = Math.min(ans, Math.max(sr - x, tr - x));
				ans = Math.min(ans, Math.max(x - sl, x - tl));
				wk_1 = (x - sl) * 2 + (tr - x);
				wk_2 = (x - sl) + (tr - x) * 2;
				ans = Math.min(ans, Math.min(wk_1, wk_2));
				wk_1 = (x - tl) * 2 + (sr - x);
				wk_2 = (x - tl) + (sr - x) * 2;
				ans = Math.min(ans, Math.min(wk_1, wk_2));
			}
			out.println(ans);
		}
    }
    // ------------------------------------------
    // 入力
    // ------------------------------------------
    public int ni() {
    	return sc.nextInt();
    }
    public long nl() {
    	return sc.nextLong();
    }
    public String ns() {
    	return sc.next();
    }
    public char[] nc() {
    	return sc.next().toCharArray();
    }
    public int[] ndi(int N) {
    	int[] ans = new int[N];
    	for (int i = 0; i < N; i++) {
			ans[i] = ni();
		}
    	return ans;
    }
    public long[] ndl(int N) {
    	long[] ans = new long[N];
    	for (int i = 0; i < N; i++) {
			ans[i] = nl();
		}
    	return ans;
    }
    public String[] nds(int N) {
    	String[] ans = new String[N];
    	for (int i = 0; i < N; i++) {
			ans[i] = ns();
		}
    	return ans;
    }
    public char[][] ndc(int N) {
    	char[][] ans = new char[N][];
    	for (int i = 0; i < N; i++) {
			ans[i] = nc();
		}
    	return ans;
    }
    public int[][] nddi(int N, int S) {
    	int[][] ans = new int[N][S];
    	for (int i = 0; i < N; i++) {
			for (int j = 0; j < S; j++) {
				ans[i][j] = ni();
			}
		}
    	return ans;
    }
}


Measured memory_bytes: 109684