#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <iostream>
#include <random>
#include <unordered_map>
#include <unordered_set>
#include <immintrin.h>

using namespace std;

//呪文
#define DUMPOUT cerr
#define dump(...) DUMPOUT<<"  ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<"    ";dump_func(__VA_ARGS__)

typedef unsigned uint; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; typedef pair<string, string> pss;
template <typename _KTy, typename _Ty> ostream& operator << (ostream& o, const pair<_KTy, _Ty>& m) { o << "{" << m.first << ", " << m.second << "}"; return o; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& o, const map<_KTy, _Ty>& m) { if (m.empty()) { o << "{ }"; return o; } o << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& o, const unordered_map<_KTy, _Ty>& m) { if (m.empty()) { o << "{ }"; return o; } o << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const vector<_Ty>& v) { if (v.empty()) { o << "{ }"; return o; } o << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const set<_Ty>& s) { if (s.empty()) { o << "{ }"; return o; } o << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const unordered_set<_Ty>& s) { if (s.empty()) { o << "{ }"; return o; } o << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { o << ", " << *itr; }	o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const stack<_Ty>& s) { if (s.empty()) { o << "{ }"; return o; } stack<_Ty> t(s); o << "{" << t.top(); t.pop(); while (!t.empty()) { o << ", " << t.top(); t.pop(); } o << "}";	return o; }
template <typename _Ty> ostream& operator << (ostream& o, const list<_Ty>& l) { if (l.empty()) { o << "{ }"; return o; } o << "{" << l.front(); for (auto itr = ++l.begin(); itr != l.end(); ++itr) { o << ", " << *itr; } o << "}"; return o; }
template <typename _KTy, typename _Ty> istream& operator >> (istream& is, pair<_KTy, _Ty>& m) { is >> m.first >> m.second; return is; }
template <typename _Ty> istream& operator >> (istream& is, vector<_Ty>& v) { for (size_t i = 0; i < v.size(); i++) is >> v[i]; return is; }
namespace aux { // print tuple
	template<typename Ty, unsigned N, unsigned L> struct tp { static void print(ostream& os, const Ty& v) { os << get<N>(v) << ", "; tp<Ty, N + 1, L>::print(os, v); } };
	template<typename Ty, unsigned N> struct tp<Ty, N, N> { static void print(ostream& os, const Ty& v) { os << get<N>(v); } };
}
template<typename... Tys> ostream& operator<<(ostream& os, const tuple<Tys...>& t) { os << "{"; aux::tp<tuple<Tys...>, 0, sizeof...(Tys) - 1>::print(os, t); os << "}"; return os; }

template<typename A, size_t N, typename T> inline void Fill(A(&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); }

void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...); }

#define PI 3.14159265358979323846
#define EPS 1e-10
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define REP(i,n)  FOR(i,0,n)
#define all(j) (j).begin(), (j).end()
#define SZ(j) ((int)(j).size())
#define fake false



#define int long long

set<int> S, T;

// X から (left or right) 方向の st(= S or T) までの最短距離
int dist(int X, set<int>& st, bool left) {
	// find なら 0
	if (st.find(X) != st.end())
		return 0;

	// left なら lower_bound - 1
	if (left) {
		int Y = *(--st.lower_bound(X));
		// INT_MIN なら invalid
		if (Y == INT64_MIN) return -1;
		return X - Y;
	}
	else {
		int Y = *(st.lower_bound(X));
		// INT_MAX なら invalid
		if (Y == INT64_MAX) return -1;
		return Y - X;
	}
}

int dist2(int X, bool left1, bool left2, bool sfirst) {
	int D1, D2, Y, Z;
	if (sfirst) {
		if (left1) {
			int D1 = dist(X, S, true);
			if (D1 < 0) return -1;
			Y = X - D1;
			if (left2) {
				int D2 = dist(Y, T, true);
				if (D2 < 0) return -1;
				Z = Y - D2;
				return D1 + D2;
			}
			else {
				int D2 = dist(Y, T, false);
				if (D2 < 0) return -1;
				Z = Y + D2;
				return D1 + D2;
			}
		}
		else {
			int D1 = dist(X, S, false);
			if (D1 < 0) return -1;
			Y = X + D1;
			if (left2) {
				int D2 = dist(Y, T, true);
				if (D2 < 0) return -1;
				Z = Y - D2;
				return D1 + D2;
			}
			else {
				int D2 = dist(Y, T, false);
				if (D2 < 0) return -1;
				Z = Y + D2;
				return D1 + D2;
			}
		}
	}
	else {
		if (left1) {
			int D1 = dist(X, T, true);
			if (D1 < 0) return -1;
			Y = X - D1;
			if (left2) {
				int D2 = dist(Y, S, true);
				if (D2 < 0) return -1;
				Z = Y - D2;
				return D1 + D2;
			}
			else {
				int D2 = dist(Y, S, false);
				if (D2 < 0) return -1;
				Z = Y + D2;
				return D1 + D2;
			}
		}
		else {
			int D1 = dist(X, T, false);
			if (D1 < 0) return -1;
			Y = X + D1;
			if (left2) {
				int D2 = dist(Y, S, true);
				if (D2 < 0) return -1;
				Z = Y - D2;
				return D1 + D2;
			}
			else {
				int D2 = dist(Y, S, false);
				if (D2 < 0) return -1;
				Z = Y + D2;
				return D1 + D2;
			}
		}
	}
}

signed main() {
	
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);

	int A, B, Q;
	cin >> A >> B >> Q;
	
	S.insert(INT64_MIN);
	S.insert(INT64_MAX);
	REP(i, A) {
		int s; cin >> s;
		S.insert(s);
	}

	T.insert(INT64_MIN);
	T.insert(INT64_MAX);
	REP(i, B) {
		int t; cin >> t;
		T.insert(t);
	}

	vector<int> x(Q);
	cin >> x;

	// (left, s), (right, t)
	// (left, t), (left, s)
	// (left, t), (right, s)
	// (right, s), (left, t)
	// (right, s), (right, t)
	// (right, t), (left, s)
	// (right, t), (right, s)
	REP(i, Q) {
		int X = x[i];
		int ans = INT64_MAX;
		for (int b = 0; b < 8; b++) {
			int d = dist2(X, b & 1, b & 0b10, b & 0b100);
			if (d == -1) continue;
			ans = min(ans, d);
		}
		cout << ans << endl;
	}

	return 0;
}



Measured memory_bytes: 12544