#include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (long long i = 0; i < n; i++)
#define RREP(i, n) for (long long i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (long long i = start; i < end; i++)
#define RFOR(i, start, end) for (long long i = start - 1; 0 <= i; i--)
#define ALL(a) a.begin(), a.end()
#define MOD(a) a %= 1'000'000'007
using ll = long long;
using namespace std;
const int INF32       = 1'050'000'000;
const long long INF64 = 4'000'000'000'000'000'000;
const int MOD7        = 1'000'000'007;
const int MOD9        = 1'000'000'009;
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;
}
void print() { std::cout << '\n'; }
template <class H, class... T> void print(H &&head, T &&... args) {
    std::cout << head;
    sizeof...(args) == 0 ? std::cout << "" : std::cout << ' ';
    print(std::forward<T>(args)...);
}
template <class T> void print(std::vector<T> &v) {
    for (int i = 0; i < v.size(); i++) {
        std::cout << v[i];
        i == v.size() - 1 ? std::cout << '\n' : std::cout << ' ';
    }
}
template <class T> void print(std::vector<std::vector<T>> &v) {
    for (int i = 0; i < v.size(); i++) {
        for (int j = 0; j < v[i].size(); j++) {
            std::cout << v[i][j];
            j == v[i].size() - 1 ? std::cout << '\n' : std::cout << ' ';
        }
    }
}

void vprint() { std::cout << '\n'; }
template <class H, class... T> void vprint(H &&head, T &&... args) {
    std::cout << head;
    sizeof...(args) == 0 ? std::cout << "" : std::cout << '\n';
    vprint(std::forward<T>(args)...);
}
template <class T> void vprint(std::vector<T> &v) {
    for (auto &&i : v) {
        std::cout << i << '\n';
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int a, b, q;
    cin >> a >> b >> q;
    vector<ll> s(a), t(b), x(q);
    for (auto &&i : s) {
        cin >> i;
    }
    for (auto &&i : t) {
        cin >> i;
    }
    vector<ll> ans_out;
    for (auto &&i : x) {
        cin >> i;
        auto rig_sh = lower_bound(ALL(s), i);
        auto rig_te = lower_bound(ALL(t), i);
        auto lef_sh = lower_bound(ALL(s), i) - 1;
        auto lef_te = lower_bound(ALL(t), i) - 1;
        ll ans      = INF64;
        if (rig_sh != s.end() && rig_te != t.end())
            chmin(ans, max(*rig_sh - i, *rig_te - i));
        if (rig_sh != s.begin() && rig_te != t.begin())
            chmin(ans, max(i - *lef_sh, i - *lef_te));
        if (rig_sh != s.end() && rig_te != t.begin()) {
            ll dist = 2 * min(abs(i - *rig_sh), abs(i - *lef_te)) +
                      max(abs(i - *rig_sh), abs(i - *lef_te));
            chmin(ans, dist);
        }
        if (rig_sh != s.begin() && rig_te != t.end()) {
            ll dist = 2 * min(abs(i - *lef_sh), abs(i - *rig_te)) +
                      max(abs(i - *lef_sh), abs(i - *rig_te));
            chmin(ans, dist);
        }
        ans_out.emplace_back(ans);
    }
    vprint(ans_out);

    return 0;
}

Measured memory_bytes: 4596