#include <bits/stdc++.h>
using namespace std;


#define li          long long int
#define rep(i,to)   for(li i=0;i<((li)(to));i++)
#define repp(i,start,to)    for(li i=(li)(start);i<((li)(to));i++)
#define pb          push_back
#define sz(v)       ((li)(v).size())
#define bgn(v)      ((v).begin())
#define eend(v)     ((v).end())
#define allof(v)    (v).begin(), (v).end()
#define dodp(v,n)       memset(v,(li)n,sizeof(v))
#define bit(n)      (1ll<<(li)(n))
#define mp(a,b)     make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1


#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b)     idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)       idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j)        idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v)   for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x)      idp p2((x).F, (x).S)
#define dump(x,n)   idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n)  idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x)    idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x)   idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}

#define read2d(a,w,h)   rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h)   rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}

typedef pair<li, li> PI;

li a, b, q;
li aa[100100];
li bb[100100];

map<li, li> ma;
map<li, li> mb;

li aad[100100];
li bbd[100100];

li x[100100];
map<li, li> mx;

PI timeline[300300];

li left_a[300300];
li right_a[300300];
li left_b[300300];
li right_b[300300];

map<li, li> res;

int main() {
    cin >> a >> b >> q;
    li num = 0;
    rep(i, a) {
        cin >> aa[i];
        ma[aa[i]] = i;
        timeline[num] = {aa[i], 0}; num++;
    }
    rep(i, b) {
        cin >> bb[i];
        mb[bb[i]] = i;
        timeline[num] = {bb[i], 1}; num++;
    }
    rep(i, q) {
        cin >> x[i];
        mx[x[i]] = i;
        timeline[num] = {x[i], 2}; num++;
    }
    sort(timeline, timeline + num);

    left_a[0] = -INF;
    left_b[0] = -INF;
    if (timeline[0].S == 0) {
        left_a[0] = 0;
    } else if (timeline[0].S == 1) {
        left_b[0] = 0;
    }
    repp(i, 1, num) {
        if (timeline[i].S == 0) {
            // a
            left_a[i] = i;
            left_b[i] = left_b[i - 1];
        } else if (timeline[i].S == 1) {
            // b
            left_a[i] = left_a[i - 1];
            left_b[i] = i;
        } else {
            // q
            left_a[i] = left_a[i - 1];
            left_b[i] = left_b[i - 1];
        }
    }

    right_a[num - 1] = INF;
    right_b[num - 1] = INF;
    if (timeline[num - 1].S == 0) {
        right_a[num - 1] = num - 1;
    } else if (timeline[num - 1].S == 1) {
        right_b[num - 1] = num - 1;
    }
    for (li i = num - 2; i >= 0; --i) {
        if (timeline[i].S == 0) {
            // a
            right_a[i] = i;
            right_b[i] = right_b[i + 1];
        } else if (timeline[i].S == 1) {
            // b
            right_a[i] = right_a[i + 1];
            right_b[i] = i;
        } else {
            // q
            right_a[i] = right_a[i + 1];
            right_b[i] = right_b[i + 1];
        }
    }

    rep(i, num) {
        if (timeline[i].S != 2)continue;

        // left
        li tres = INF;
        if (min(left_a[i], left_b[i]) > -INF) {
            li left_idx = min(left_a[i], left_b[i]);
            tres = min(tres, timeline[i].F - timeline[left_idx].F);
        }
        if (max(right_a[i], right_b[i]) < INF) {
            li right_idx = max(right_a[i], right_b[i]);
            tres = min(tres, timeline[right_idx].F - timeline[i].F);
        }
        if (left_a[i] > -INF && right_b[i] < INF) {
            li dist_left = timeline[i].F - timeline[left_a[i]].F;
            li dist_right = timeline[right_b[i]].F - timeline[i].F;
            tres = min(tres,
                       dist_left +
                       dist_right +
                       min(dist_left, dist_right));
        }
        if (left_b[i] > -INF && right_a[i] < INF) {
            li dist_left = timeline[i].F - timeline[left_b[i]].F;
            li dist_right = timeline[right_a[i]].F - timeline[i].F;
            tres = min(tres,
                       dist_left +
                       dist_right +
                       min(dist_left, dist_right));
        }
        res[timeline[i].F] = tres;
    }


    rep(i, q) {
        cout << res[x[i]] << endl;
    }

    return 0;
}

Measured memory_bytes: 44288