#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  for(int i=0;i<(n);++i)
#define REPr(i,n) for(int i=(n)-1;i>=0; --i)
#define FORq(i, m, n) for(int i = (m);i <= (n);++i)
#define FORqr(i, m , n) for(int i = (n);i >=(m);--i)
#define SCD(n) scanf("%d",&n)
#define SCD2(m,n) scanf("%d%d",&m,&n)
#define SCD3(m,n,k) scanf("%d%d%d",&m,&n,&k)
#define SCLLD(n) scanf("%lld",&n)
#define SCLLD2(m,n) scanf("%lld%lld",&m,&n)
#define SCLLD3(m,n,k) scanf("%lld%lld%lld",&m,&n,&k)
#define PB push_back
#define MP make_pair
#define ARSCD(A,N) REP(i,N){SCD(A[i]);}
#define ARSCD1(A,N) FORq(i,1,N){SCD(A[i]);}
#define VSCD(v,N) REP(i,N){int (x); SCD(x); v.PB(x);}
#define VSCLLD(v,N) REP(i,N){long long (x); SCLLD(x); v.PB(x);}
#define PRINTD(n) printf("%d\n",n)
#define PRINTLLD(n) printf("%lld\n",n)
#define DEBUG printf("%s\n","debug")
#define fst first
#define snd second
#define SIN(x,S) (S.count(x) != 0)
#define M0(x) memset(x,0,sizeof(x))
#define FILL(x,y) memset(x,y,sizeof(x))
#define MM(x) memset(x,-1,sizeof(x))
#define ALL(x) (x).begin(),(x).end()
using namespace std;
typedef pair<int,int> PII;
typedef pair<long long,long long> PLL;
typedef vector<int> VI;
typedef vector < VI > VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
///////////////////////////////////////////////
const ll MOD = 1000000007;
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}

template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
///////////////////////////////////////////////
int main(){
    int A,B,Q;
    cin >> A >> B >> Q;
    vector<ll> S;
    vector<ll> T;

    REP(i,A){
        ll x; cin >> x;
        S.PB(x);
    }
    REP(i,B){
        ll x; cin >> x;
        T.PB(x);
    }
    S.PB(1000000000000000);
    T.PB(1000000000000000);
    vector<ll> ans;

    REP(i,Q){
        ll x; cin >> x;
        auto Itr = lower_bound(ALL(S), x);
        int ind1 = Itr - S.begin();

        Itr = lower_bound(ALL(T), x);
        int ind2 = Itr - T.begin();

        ll ds1,ds2,dt1,dt2;
        
        ds2 = S[ind1];
        dt2 = T[ind2];
        if (ind1 == 0) ds1 = S[0];
        else ds1 = S[ind1-1];

        if (ind2 == 0) dt1 = T[0];
        else dt1 = T[ind2-1];

        if (x > S[A-1]) ds1 = ds2 = S[A-1];
        if (x > T[B-1]) dt1 = dt2 = T[B-1];
      // cout << ind1 << ", " << ind2 << "\n";
       //cout << ds1 << "," << ds2 << "," <<dt1 << "," << dt2 << "\n";
       ll diffs1,diffs2,difft1,difft2;
       diffs1 = x - ds1; diffs2 = ds2 - x;
       difft1 = x - dt1; difft2 = dt2 - x;
       if (diffs1 < 0) diffs1 = 100000000000;
       if (difft1 < 0) difft1 = 100000000000;
       if (diffs2 < 0) diffs2 = 100000000000;
       if (difft2 < 0) difft2 = 100000000000;

    //cout << diffs1 << "," << diffs2 << "," << difft1 << "," << difft2 << "\n";
       ll nans; 
       nans = min({max(diffs1,difft1),diffs1*2+difft2,diffs2*2 + difft1,diffs2 *2 + difft2,difft1*2+diffs1,difft2*2+diffs1,difft1*2+diffs2,max(diffs2,difft2)});
        ans.PB(nans);    
       //  cout << nans << "\n";   
    }

    REP(i,Q){
        cout << ans[i] << endl;
    }
}


Measured memory_bytes: 3828