#include <bits/stdc++.h>

using namespace std;

#define countof(a) (sizeof(a)/sizeof(*a))

#define vi vector<int>
#define vvi vector<vector<int> >
#define vpi vector<pi >
#define pi pair<int,int>
#define mp make_pair
#define fi first
#define se second
#define all(n) n.begin(), n.end()

#define FROMTO(var, from, to) for (register int var = (from), var##down = ((int)(to)) < ((int)(from));var##down ? (var >= (int)(to)) : (var <= (int)(to));var##down ? var-- : var++)
#define UPTO(var, from, to)   for (register int var = (from); var <= ((int)to); var++)
#define DOWNTO(var, from, to) for (register int var = (from); var >= ((int)to); var--)
#define FOR(var, to)          UPTO(var, 0, (to)-1)
#define DOWN(var, from)       DOWNTO(var, (from)-1, 0)

#define INIT(var, val) FOR(i,countof(var)) var[i] = val
#define INPUT(var) FOR(i,countof(var)) cin >> var[i]
#define INPUT1(var) FOR(i,countof(var)) cin >> var[i], var[i]--

#define SORT(v) qsort(v,countof(v),sizeof(*v),int_less)
#define SORTT(v) qsort(v,countof(v),sizeof(*v),int_greater)
#define QSORT(v,b) qsort(v,countof(v),sizeof(*v),b)

#define MOD 1000000007
#define INF ((1 << 30)-1)
#define LINF ((1LL << 62)-1)

typedef uint8_t u8;
typedef uint16_t u16;
typedef uint32_t u32;
typedef uint64_t u64;
typedef int8_t s8;
typedef int16_t s16;
typedef int32_t s32;
typedef int64_t s64;

struct Comb {
    vector<vector<s64> > data;
    Comb(int n) { // O(n^2)
        data = vector<vector<s64> >(n+1,vector<s64>(n+1,1));
        UPTO(i,1,n) {
            FOR(j,i+1) {
                if (!j || j == i) data[i][j] = 1;
                else data[i][j] = data[i-1][j-1] + data[i-1][j];
            }
        }
    }

    s64 ncr(int n, int r) {
        return data[n][r];
    }
};

static inline int ri() {
  int a;
  scanf("%d", &a);
  return a;
}

int int_less(const void *a, const void *b) {
  return (*((const int*)a) - *((const int*)b));
}
int int_greater(const void *a, const void *b) {
  return (*((const int*)b) - *((const int*)a));
}

int main() {
	int n = ri(), m = ri(), q = ri();
	s64 a[n];
	s64 b[m];
	INPUT(a);
	INPUT(b);
	sort(a,a+n);
	sort(b,b+m);
	s64 x[q];
	INPUT(x);
	s64 sa[n];
	s64 sb[m];
	FOR(i,n) {
		s64 res = LINF;
		s64 * itr = lower_bound(b,b+m, a[i]);
		if (itr != b+m) {
			s64 cur = abs(*itr-a[i]);
			if (res > cur) res = cur;
		}
		if (itr != b) {
			s64 cur = abs(*(itr-1)-a[i]);
			if (res > cur) res = cur;
		}
		sa[i] = res;
	}
	FOR(i,m) {
		s64 res = LINF;
		s64 * itr = lower_bound(a,a+n, b[i]);
		if (itr != a+n) {
			s64 cur = abs(*itr-b[i]);
			if (res > cur) res = cur;
		}
		if (itr != a) {
			s64 cur = abs(*(itr-1)-b[i]);
			if (res > cur) res = cur;
		}
		sb[i] = res;
	}
	FOR(i,q) {
		s64 res = LINF;
		// first a
		{
			s64 *itr = lower_bound(a,a+n, x[i]);
			int ii = itr-a;
			if (itr != a+n) {
				s64 cur = abs(*itr-x[i]);
				res = min(res, cur + sa[ii]);
			}
			if (itr != a) {
				s64 cur = abs(*(itr-1)-x[i]);
				res = min(res, cur + sa[ii-1]);
			}
		}
		// first b
		{
			s64 *itr = lower_bound(b,b+m, x[i]);
			int ii = itr-b;
			if (itr != b+m) {
				s64 cur = abs(*itr-x[i]);
				res = min(res, cur + sb[ii]);
			}
			if (itr != b) {
				s64 cur = abs(*(itr-1)-x[i]);
				res = min(res, cur + sb[ii-1]);
			}
		}
		cout << res << endl;
	}

    return 0;
}


Measured memory_bytes: 5248