#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep2(j,n) for(int j = 0; j < (n); ++j)
#define lrep(i,n) for(long long int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define srep2(j,s,t) for (int j = s; j < t; ++j)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define Pques(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("YES");}else{puts("NO");}
const int MX = 200005;

int main() {
  int A,B;
  int q;
  cin >> A >> B >> q;
  ll s[A];
  ll t[B];
  ll x[q];
  lrep(i,A) {
    cin >> s[i];
  }
  lrep(i,B) {
    cin >> t[i];
  }
  ll MAXX = 0;
  lrep(i,q) {
    cin >> x[i];
    MAXX = max(MAXX, x[i]);
  }
  v(ll) vs(s,s + A);
  v(ll) vt(t,t + B);
  
  rep2(j,q) {
    // s
    ll s_be = -LINF;
    ll s_af = -LINF;
    auto sres = lower_bound(rng(vs),x[j]);
    if(*sres == 0) {
      s_be = vs[distance(vs.begin(),sres) - 1];
    } else if (distance(vs.begin(),sres) == 0) {
      s_af = *sres;
    } else {
      s_af = *sres;
      s_be = vs[distance(vs.begin(),sres) - 1];
    }

    // t

    ll t_be = -LINF;
    ll t_af = -LINF;
    v(ll)::iterator tres = lower_bound(rng(vt),x[j]);
    if(*tres == *vt.end()) {
      t_be = vt[distance(vt.begin(),tres) - 1];
    } else if (distance(vt.begin(),tres) == 0) {
      t_af = *tres;
    } else {
      t_af = *tres;
      t_be = vt[distance(vt.begin(),tres) - 1];
    }

    //cout << x[j] << " | s_be : " << s_be << " s_af : " << s_af << " t_be : " << t_be << " t_af : " << t_af << endl;
    
    ll ans = LINF;
    if(s_be != -LINF && t_be != -LINF) {
      ans = min(ans,x[j] - min(s_be,t_be));
    }
    if(s_af != -LINF && t_af != -LINF) {
      ans = min(ans,max(s_af,t_af) - x[j]);
    }
    if(s_be != -LINF && t_af != -LINF) {
      ans = min(ans,(x[j] - s_be) + (t_af - x[j]) + min((x[j] - s_be),(t_af - x[j])));
    }
    if(s_af != -LINF && t_be != -LINF) {
      ans = min(ans,(x[j] - t_be) + (s_af - x[j]) + min((x[j] - t_be),(s_af - x[j])));
    }
    
    cout << ans << endl;
  }
  
  return 0;
}

Measured memory_bytes: 5248