#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;

const ll MOD = (ll)1e9 + 7;
const ll MOD2 = 998244353;
const ll LLINF = (ll)1e18;
const ll INTINF = (ll)1e9;
const long double PI = 3.1415926535897932384626433;

template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max<T>(a,b);}
template <class T> void chmin(T& a, const T b){a=min<T>(a,b);}
void YN(bool flg) {cout << ((flg) ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << ((flg) ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << ((flg) ? "yes" : "no") << endl;}

int main() {
	int A,B,Q; cin >> A >> B >> Q;
	V<ll> s(A),t(B),x(Q);
	REP(i,A) cin >> s[i];
	REP(i,B) cin >> t[i];
	REP(i,Q) cin >> x[i];
	V<ll> u(A,LLINF),v(B,LLINF),ans(Q,LLINF);
	for(int i = 0; i < A; ++i){
		int idx = lower_bound(ALL(t),s[i])-t.begin();
		if(idx<B) chmin(u[i],abs(s[i]-t[idx]));
		if(0<idx) chmin(u[i],abs(s[i]-t[idx-1]));
	}
	for(int i = 0; i < B; ++i){
		int idx = lower_bound(ALL(s),t[i])-s.begin();
		if(idx<A) chmin(v[i],abs(t[i]-s[idx]));
		if(0<idx) chmin(v[i],abs(t[i]-s[idx-1]));
	}
	for(int i = 0; i < Q; ++i){
		int idx;
		idx = lower_bound(ALL(s),x[i])-s.begin();
		if(idx<A) chmin(ans[i],abs(x[i]-s[idx])+u[idx]);
		if(0<idx) chmin(ans[i],abs(x[i]-s[idx-1])+u[idx-1]);
		idx = lower_bound(ALL(t),x[i])-t.begin();
		if(idx<B) chmin(ans[i],abs(x[i]-t[idx])+v[idx]);
		if(0<idx) chmin(ans[i],abs(x[i]-t[idx-1])+v[idx-1]);
	}
	REP(i,Q) cout << ans[i] << endl;

	return 0;
}


Measured memory_bytes: 6016