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

#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (n); ++(i))
#define repp(i, m, n) for (int (i) = (m); (i) < (n); ++(i))
#define dbg(x) cerr << #x << ": " << x << endl;
#define dbg2(x, y) cerr<<"("<<#x<<", "<<#y<<") = "<<"("<<x<<", "<<y<<")"<<endl;
#define dbg3(x, y, z) cerr<<"("<<#x<<", "<<#y<<", "<<#z<<") = "<<"("<<x<<", "<<y<<", "<<z<<")"<<endl;
#define dbgB(value, size) cerr<<#value<<": "<<bitset<size>(value) << endl;
#define line() cerr << "---------------" << endl;

const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const double PI = 3.14159265358979323846;

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<typename T>
void print1(T begin, T end) {
  while (begin != end) {
    cout << (*begin) << " ";
    *begin++;
  }
  cout << endl;
}

template<typename T>
void print2(T Array, int height, int width) {
  for (int i = 0; i < height; i++) {
    for (int j = 0; j < width; j++) {
      cout << " " << Array[i][j];
    }
    cout << endl;
  }
}

void print() { std::cerr << endl; }
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
  std::cerr << head << " ";
  print(std::forward<Tail>(tail)...);
}

template<class T>
void Add(T &a, const T &b, const T &mod=1000000007) {
  int val = ((a % mod) + (b % mod)) % mod;
  if (val < 0) { val += mod; }
  a = val;
}

// ------------------------------------------------------------------------------------------

const int INF = 1e18;

int A, B, Q;
vec<int> s, t;


int solve(int key) {
  int ret = INF;
  // 1
  auto itr1 = lower_bound(all(s), key);
  auto itr2 = lower_bound(all(t), key);
  if (abs(*itr1) != INF and abs(*itr2) != INF) {
    // dbg2(*itr1, *itr2)
    chmin(ret, max(*itr1, *itr2) - key);
  }

  // 2.t-s
  auto t1 = upper_bound(all(t), key) - 1;
  auto s1 = lower_bound(all(s), key);
  if (abs(*t1) != INF && abs(*s1) != INF) {
    // dbg2(*t1, *s1)
    chmin(ret, abs(*s1 - *t1) + min(abs(key-*s1), abs(key-*t1)));
  }

  // 2.s-t
  auto s2 = upper_bound(all(s), key) - 1;
  auto t2 = lower_bound(all(t), key);
  if (abs(*t2) != INF && abs(*s2) != INF) {
    // dbg2(*t2, *s2)
    chmin(ret, abs(*s2 - *t2) + min(abs(key-*s2), abs(key-*t2)));
  }

  // 3
  auto itr3 = upper_bound(all(s), key) - 1;
  auto itr4 = upper_bound(all(t), key) - 1;
  if (abs(*itr3) != INF and abs(*itr4) != INF) {
    // dbg2(*itr3, *itr4)
    chmin(ret, key - min(*itr3, *itr4));
  }

  return ret;
}

signed main() {
  cin >> A >> B >> Q;
  s.resize(A);
  t.resize(B);
  rep (i, A) { cin >> s[i]; }
  rep (i, B) { cin >> t[i]; }
  s.push_back(INF);
  t.push_back(INF);
  s.push_back(-INF);
  t.push_back(-INF);
  sort(all(s));
  sort(all(t));

  while (Q--) {
    int x;
    cin >> x;
    int ans = solve(x);
    // dbg(ans)
    // line()
    cout << ans << endl;
  }

  return 0;
}

Measured memory_bytes: 2912