/*
confirm 0LL and 1LL
confirm cornercases such as 0
confirm times of cin < 10^6
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<VecP>;
template <typename T>
using Vec1 = vector<T>;
template <typename T>
using Vec2 = vector<Vec1<T> >;
#define REP(i, m, n) for(ll (i) = (m); (i) < (n); ++(i))
#define REPN(i, m, n) for(ll (i) = (m); (i) <= (n); ++(i))
#define REPR(i, m, n) for(ll (i) = (m)-1; (i) >= (n); --(i))
#define REPNR(i, m, n) for(ll (i) = (m); (i) >= (n); --(i))
#define rep(i, n) REP(i, 0, n)
#define repn(i, n) REPN(i, 1, n)
#define repr(i, n) REPR(i, n, 0)
#define repnr(i, n) REPNR(i, n, 1)
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define fs first
#define sc second
template <typename T>
bool chmax(T &a, const T b){if(a < b){a = b; return true;} return false;}
template <typename T>
bool chmin(T &a, const T b){if(a > b){a = b; return true;} return false;}
template <typename T>
ll pow2(const T n){return (1LL << n);}
template <typename T>
void cosp(const T n){cout << n << ' ';}
void co(void){cout << '\n';}
template <typename T>
void co(const T n){cout << n << '\n';}
template <typename T1, typename T2>
void co(pair<T1, T2> p){cout << p.fs << ' ' << p.sc << '\n';}
template <typename T>
void co(const Vec1<T> &v){for(T i : v) cosp(i); co();}
template <typename T>
void co(initializer_list<T> v){for(T i : v) cosp(i); co();}
template <typename T>
void ce(const T n){cerr << n << endl;}
template <typename T>
void ce(initializer_list<T> v){for(T i : v) cerr << i << ' '; cout << endl;}
void sonic(){ios::sync_with_stdio(false); cin.tie(0);}
void setp(const ll n){cout << fixed << setprecision(n);}
constexpr int INF = 1e9+1;
constexpr ll LINF = 1e18+1;
constexpr ll MOD = 2019;
//constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-11;
const ld PI = acos(-1);

int main(void){
	ll a, b, q;
	cin >> a >> b >> q;
	Vec s(a), t(b);
	rep(i, a) cin >> s[i];
	rep(i, b) cin >> t[i];
	rep(i, q){
		ll x;
		cin >> x;
		ll ans = LINF;
		auto it1 = lower_bound(all(s), x);
		if(it1 != s.end()){
			auto it2 = lower_bound(all(t), *it1);
			if(it2 != t.end()) chmin(ans, abs(x - *it1) + abs(*it1 - *it2));
			if(it2 != t.begin()) chmin(ans, abs(x - *it1) + abs(*it1 - *--it2));
		}
		if(it1 != s.begin()){
			--it1;
			auto it2 = lower_bound(all(t), *it1);
			if(it2 != t.end()) chmin(ans, abs(x - *it1) + abs(*it1 - *it2));
			if(it2 != t.begin()) chmin(ans, abs(x - *it1) + abs(*it1 - *--it2));
		}
		it1 = lower_bound(all(t), x);
		if(it1 != t.end()){
			auto it2 = lower_bound(all(s), *it1);
			if(it2 != s.end()) chmin(ans, abs(x - *it1) + abs(*it1 - *it2));
			if(it2 != s.begin()) chmin(ans, abs(x - *it1) + abs(*it1 - *--it2));
		}
		if(it1 != t.begin()){
			--it1;
			auto it2 = lower_bound(all(s), *it1);
			if(it2 != s.end()) chmin(ans, abs(x - *it1) + abs(*it1 - *it2));
			if(it2 != s.begin()) chmin(ans, abs(x - *it1) + abs(*it1 - *--it2));
		}
		co(ans);
	}

	return 0;
}


Measured memory_bytes: 2944