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

/* macro */
#define rep(i,a,b) for(int i=a;i<b;i++)
#define revrep(i,a,b) for(int i = a; i > b; i--)
#define int long long
#define exist(s,e) ((s).find(e)!=(s).end())
#define all(v) (v).begin(), (v).end()
#define each(s,itr) for(auto (itr) = s.begin(); (itr) != s.end(); (itr)++)
#define sum(v) accumulate(all(v), (0LL))
#define isin(a, b, c) (b <= a && a <= c)
#define println cout << "\n";
#define sz(v) (int)v.size()


/* alias */
template<class T> using vec = vector<T>;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef tuple<int, int, int> ti;
typedef map<int, int> mi;
typedef set<int> si;


/* constant */
const int inf = 1LL << 62;
const int mod = 1e9 + 7;
const int dx[8]={1,0,-1,0,-1,1,-1,1};
const int dy[8]={0,1,0,-1,-1,-1,1,1};
const string alphabet = "abcdefghijklmnopqrstuvwxyz";

/* io_method */
int input(){int tmp;cin >> tmp;return tmp;}
string raw_input(){string tmp;cin >> tmp;return tmp;}
template<class T> void printx(T n){cout << n;}
template<class T, class U> void printx(pair<T, U> p){cout << "(" << p.first << "," << p.second << ")";}
template<class T, class U, class V> void printx(tuple<T, U, V> t){cout << "{" << get<0>(t) << "," << get<1>(t) <<"," << get<2>(t) << "}" << endl;}
template<class T> void printx(vector<T> v){cout << "{";rep(i,0,v.size()){printx(v[i]);if(i != v.size()-1)printx(",");}cout << "}";}
template<class T> void print(T n){printx(n);cout << endl;}
template<class T> void print(set<T> s){cout << "{";each(s, e){if(e != s.begin()) printx(",");printx(*e);}cout << "}" << endl;}
template<class T, class U> void print(map<T, U> mp){cout << "{";each(mp, e){cout << "(" << e -> first << "," << e -> second << ")";}cout << "}" << endl;}
template<class T> void printans(vec<T> v){rep(i,0,sz(v)){cout << v[i] << (i == sz(v) - 1 ? "" : " ");}cout << endl;}


/* general_method */
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<class T>T cut(T &a, int l, int r){return T(a.begin()+l, a.begin()+r);}

/* main */

int a,b,c;
vi ai;
vi bi;
vi ci;
void in(){
    cin >> a >> b >> c;
    rep(i,0,a) ai.push_back(input());
    rep(i,0,b) bi.push_back(input());
    rep(i,0,c) ci.push_back(input());
}

void solve(){

    rep(i,0,c){
        int x = ci[i];

        int ans = inf;
        
        //previous ai;
        auto aright = lower_bound(all(ai), x);

        auto aleft = aright;
        
        //aleft
        if(aleft != ai.begin()){
            aleft--;

            auto bright = lower_bound(all(bi), *aleft);

            //aleft bleft
            auto bleft = bright;
            if(bleft != bi.begin()){
                bleft--;
                chmin(ans, abs(*aleft - x) + abs(*bleft - *aleft));
            }
            
            //aleft bright
            chmin(ans, abs(*aleft - x) + abs(*bright - *aleft));

        }

        //aright
        auto bright = lower_bound(all(bi), *aright);
        auto bleft = bright;
        
        //aright bleft
        if(bleft != bi.begin()){
            bleft--;
            chmin(ans, abs(*aright - x) + abs(*bleft - *aright));
        }

        chmin(ans, abs(*aright - x) + abs(*aright - *bright));



        //previous bi;

        bright = lower_bound(all(bi), x);
        bleft = bright;

        //bleft
        if(bleft != bi.begin()){
            bleft--;
            aright = lower_bound(all(ai), *bleft);

            //bleft aleft
            aleft = aright;
            if(aleft != ai.begin()){
                aleft--;
                chmin(ans, abs(*bleft - x) + abs(*aleft - * bleft));
            }

            //bleft aright
            chmin(ans, abs(*bleft - x) + abs(*aright - *bleft));

        }

        //bright
        aright = lower_bound(all(ai), *bright);

        //bright aleft
        aleft = aright;
        if(aleft != ai.begin()){
            aleft--;
            chmin(ans, abs(x - *bright) + abs(*bright - *aleft));
        }

        //bright aright
        chmin(ans, abs(x - *bright) + abs(*bright - *aright));

        print(ans);



    }


}

signed main(){

    cin.tie(0);
    ios::sync_with_stdio(false);
    in();
    solve();
    
}

Measured memory_bytes: 3828