#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

#define MOD 1000000007
#define MOD2 998244353
#define int long long
#define EPS 1e-9
//#define PI 3.14159265358979

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;

template < typename T >
ostream &operator<<(ostream &os, const vector< T > &A) {
	for (int i = 0; i < A.size(); i++)
		os << A[i] << " ";
	os << endl;
	return os;
}
template <>
ostream &operator<<(ostream &os, const vector< vector< int > > &A) {
	int N = A.size();
	int M;
	if (N > 0)
		M = A[0].size();
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < M; j++)
			os << A[i][j] << " ";
		os << endl;
	}
	return os;
}

typedef pair< int, int > pii;
typedef long long ll;

struct edge {
	int from, to, d, c;
	edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
		from = _from;
		to = _to;
		d = _d;
		c = _c;
	}
	bool operator<(const edge &rhs) const {
		return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
	}
};
struct aabb {
	int x1, y1, x2, y2;
	aabb(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {}
};

typedef vector< edge > edges;
typedef vector< edges > graph;
struct flow {
	int to, cap, rev, cost;
	flow(int to = 0, int cap = 0, int rev = 0, int cost = 0) : to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector< vector< flow > > flows;

const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);

int pow2(int n) { return 1LL << n; }
template < typename T, typename U >
bool chmin(T &x, const U &y) {
	if (x > y) {
		x = y;
		return true;
	}
	return false;
}
template < typename T, typename U >
bool chmax(T &x, const U &y) {
	if (x < y) {
		x = y;
		return true;
	}
	return false;
}

struct initializer {
	initializer() {
		cout << fixed << setprecision(20);
	}
};
initializer _____;
int compress(vector< int > &x1, vector< int > &x2, vector< int > &x3) {
	vector< int > xs;
	int N = x1.size();
	int M = x2.size();
	int Q = x3.size();
	rep(i, N) xs.push_back(x1[i]);
	rep(i, M) xs.push_back(x2[i]);
	rep(i, Q) xs.push_back(x3[i]);
	sort(xs.begin(), xs.end());
	xs.erase(unique(xs.begin(), xs.end()), xs.end());
	rep(i, N)
		x1[i] = lower_bound(xs.begin(), xs.end(), x1[i]) - xs.begin();
	rep(i, M)
		x2[i] = lower_bound(xs.begin(), xs.end(), x2[i]) - xs.begin();
	rep(i, Q)
		x3[i] = lower_bound(xs.begin(), xs.end(), x3[i]) - xs.begin();

	return xs.size();
}
int N, M, K, T, Q, H, W;
signed main() {
	cin >> N >> M >> Q;
	vector< int > A(N), B(M), X(Q);
	rep(i, N) cin >> A[i];
	rep(i, M) cin >> B[i];
	rep(i, Q) cin >> X[i];
	//compress(A, B, X);
	rep(i, Q) {
		int x = X[i];
		int ra = -1, la = -1, rb = -1, lb = -1;
		auto it = upper_bound(A.begin(), A.end(), x);
		if (it != A.end())
			ra = abs(x - *it);
		if (it != A.begin()) {
			it--;
			la = abs(x - *it);
		}
		it = upper_bound(B.begin(), B.end(), x);
		if (it != B.end())
			rb = abs(x - *it);
		if (it != B.begin()) {
			it--;
			lb = abs(x - *it);
		}
		int ans = LINF;
		if (la != -1 && lb != -1) {
			chmin(ans, max(la, lb));
		}
		if (ra != -1 && rb != -1) {
			chmin(ans, max(ra, rb));
		}
		if (la != -1 && rb != -1) {
			chmin(ans, min(la, rb) * 2 + max(la, rb));
		}
		if (lb != -1 && ra != -1) {
			chmin(ans, min(lb, ra) * 2 + max(lb, ra));
		}
		cout << ans << endl;
	}
	return 0;
}

Measured memory_bytes: 3712