#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>

/***** type *****/
using namespace std;
using ll = long long;
using ld = long double;
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;
template <class T> using vvvt = vector<vector<vector<T>>>;
template <class T1, class T2> using umap = unordered_map<T1, T2>;
using ml = boost::multiprecision::cpp_int;

/***** define *****/
#define all(c) (c).begin(), (c).end()            // begin to end
#define rep(i, b, e) for (ll i = b; i < e; i++)  // repeat
#define repr(i, b, e) for (ll i = b; e < i; i--) // repeat reverse
#define val(itr) *(itr)                          // get value
/***** const value *****/
#define llong_max 9223372036854775807            // 9 * 10^18
#define ldbl_max 1.79769e+308                    // 1.7 * 10^308
#define pi 3.1415926535897932                    // 3.14 ...
/***** for each macro *****/
#define fori(i, ...) if(ll i = -1) for(__VA_ARGS__) if(i++, true)
#define each(i, e, c) fori(i, auto e = c.begin(); e != c.end(); ++e)
#define forir(i, v, ...) if(ll i=(ll)v.size())for(__VA_ARGS__)if(i--,true)
#define eachr(i, e, c) forir(i, auto e = c.rbegin(); e != c.rend(); ++e)

/***** lambda *****/
auto Count = [] // long long count value
(auto b, auto e, auto x) { return (ll)count(b, e, x); };
auto CtoN = [] // char to number
(auto c) { return (ll)(c - '0'); };
auto DivC = [] // long double div ceiling
(auto a, auto b) { return ceil((ld)a / (ld)b); };
auto Fix = [] // fix value
(auto b, auto e, auto fix)
{ for (auto it = b; it != e; ++it)*it += fix; };
auto Pow = [] // long long pow
(auto a, auto b) { return (ll)pow(a, b); };
auto Pow2 = [] // long long pow2
(auto n) { return (1LL << n); };
auto Pow10 = [] // long long pow10
(auto n) { return (ll)pow(10, n); };
auto Size = []  // long long collection size
(auto& c) { return (ll)(c).size(); };
auto Sum = [] // long long accumulate
(auto b, auto e) { return accumulate(b, e, 0LL); };

/***** template *****/
template <class T> vvt<T> VVT
(ll ys, ll xs, T fill = T())
{	// vector<vector<T>> resize + fill
	vvt<T> v(ys);
	each(i, y, v) { y->resize(xs, fill); } return v;
}
template <class T> vvvt<T> VVVT
(ll zs, ll ys, ll xs, T fill = T())
{	// vector<vector<vector<T>>> resize + fill
	vvvt<T> v(zs);
	each(i, z, v) { val(z) = VVT(ys, xs, fill); } return v;
}
template <class T> vt<T> InputVT
(ll size, T fix = T())
{	// input vector<T> (T != struct) + fix
	vt<T> v(size);
	rep(i, 0, size) { cin >> v[i]; v[i] += fix; }
	return v;
}
template <class T> vvt<T> InputVVT
(ll ys, ll xs, T fix = T())
{	// input vector<vector<T>> (T != struct) + fix
	vvt<T> v(ys); each(i, y, v) y->resize(xs);
	rep(y, 0, ys) rep(x, 0, xs) { cin >> v[y][x]; v[y][x] += fix; }
	return v;
}
template <class T> vvvt<T> InputVVVT
(ll zs, ll ys, ll xs, T fix = T())
{	// input vector<vector<vector<T>>> (T != struct) + fix
	vvvt<T> v(zs);
	each(i, z, v) { val(z) = InputVVT<T>(ys, xs, fix); }
	return v;
}

namespace NyaGadget
{
	/*** 二分探索ライブラリ ***/

	template <class T> struct BinarySearchResult
	{
		T b;              // 先頭アドレス
		long long i = 0;  // インデックス 
		long long v = 0;  // 値
		long long cl = 0; // 条件を満たさない要素数(iと同じ)
		long long cr = 0; // 条件を満たす要素数
		BinarySearchResult<T> operator++()
		{
			if (cr != 1)
			{
				i++;
				v = *(b + i);
				cl++;
				cr--;
			}
			return *this;
		}
		BinarySearchResult<T> operator++(int)
		{
			BinarySearchResult res = *this;
			++(*this);
			return res;
		}
		BinarySearchResult<T> operator--()
		{
			if (i != 0)
			{
				i--;
				v = *(b + i);
				cl--;
				cr++;
			}
			return *this;
		}
		BinarySearchResult<T> operator--(int)
		{
			BinarySearchResult res = *this;
			--(*this);
			return res;
		}
	};

	/**
	@brief 値x以上となる最初の要素を取得する関数
	@param b 検索する範囲開始位置
	@param e 検索する範囲終端位置
	@param x 検索する値
	**/
	template <class T1, class T2>
	BinarySearchResult<T1> LowerBound(T1 b, T1 e, T2 x)
	{
		auto it = lower_bound(b, e, x);
		if (it == e) it--;
		return { b, it - b, *it, it - b , e - it };
	}

	/**
	@brief 値xより大きい最初の要素を取得する関数
	@param b 検索する範囲開始位置
	@param e 検索する範囲終端位置
	@param x 検索する値
	**/
	template <class T1, class T2>
	BinarySearchResult<T1> UpperBound(T1 b, T1 e, T2 x)
	{
		auto it = upper_bound(b, e, x);
		if (it == e) it--;
		return { b, it - b, *it, it - b, e - it };
	}

	/*** BinarySearchResult 演算子 ***/
	template <class T>
	const BinarySearchResult<T> operator+(const BinarySearchResult<T>& l, long long r)
	{
		if (l.i + r < 0) r = l.i;
		if (l.cr - 1 < r) r = l.cr - 1;
		return { l.b, l.i + r, *(l.b + l.i + r), l.cl + r, l.cr - r };
	}
	template <class T>
	const BinarySearchResult<T> operator-(const BinarySearchResult<T>& l, long long r)
	{
		if (l.i - r < 0) r = l.i;
		if (l.cr - 1 < -r) r = -(l.cr - 1);
		return { l.b, l.i - r, *(l.b + l.i - r), l.cl - r, l.cr + r };
	}
	template <class T>
	void operator+=(BinarySearchResult<T>& l, long long r)
	{
		if (l.i + r < 0) r = l.i;
		if (l.cr - 1 < r) r = l.cr - 1;
		l = { l.b, l.i + r, *(l.b + l.i + r), l.cl + r, l.cr -= r };
	}
	template <class T>
	void operator-=(BinarySearchResult<T>& l, long long r)
	{
		if (l.i - r < 0) r = l.i;
		if (l.cr - 1 < -r) r = -(l.cr - 1);
		l = { l.b, l.i - r, *(l.b + l.i - r), l.cl - r, l.cr + r };
	}
}

using namespace NyaGadget;
//using mll = ModLL<1000000007>;

int main(void)
{
	ll A, B, Q; cin >> A >> B >> Q;
	vt<ll> s = InputVT<ll>(A); sort(all(s));
	vt<ll> t = InputVT<ll>(B); sort(all(t));
	vt<ll> x = InputVT<ll>(Q);

	each(i, e, x)
	{
		ll ans = LLONG_MAX;
		auto s2 = UpperBound(all(s), val(e));
		auto t2 = UpperBound(all(t), val(e));
		auto s1 = s2 - 1;
		auto t1 = t2 - 1;

		vt<ll> stest = { s1.v, s2.v };
		vt<ll> ttest = { t1.v, t2.v };

		each(i, s, stest) each(j, t, ttest)
		{
			ans = min(ans, abs(val(e) - val(s)) + abs(val(s) - val(t)));
			ans = min(ans, abs(val(e) - val(t)) + abs(val(t) - val(s)));
		}
		cout << ans << endl;
	}

	return 0;
}


Measured memory_bytes: 3712