#include<stdio.h>
int abs(int n)
{
	if (n < 0)
		n *= -1;
	return n;
}
int n, ka, kb;
int a[300005], b[300005];
int id_a(int v)
{
	int min, mid, max;
	min = -1;
	max = ka;
	while (max - min > 1)
	{
		mid = (max + min) / 2;
		if (a[mid] < v)
			min = mid;
		else
			max = mid;
	}
	if (min < 0)
		return a[max];
	else if (max == ka)
		return a[min];
	else if (v - a[min] < a[max] - v)
		return a[min];
	else
		return a[max];
}
int id_b(int v)
{
	int min, mid, max;
	min = -1;
	max = kb;
	while (max - min > 1)
	{
		mid = (max + min) / 2;
		if (b[mid] < v)
			min = mid;
		else
			max = mid;
	}
	if (min < 0)
		return b[max];
	else if (max == kb)
		return b[min];
	else if (v - b[min] < b[max] - v)
		return b[min];
	else
		return b[max];
}
int main()
{
	scanf("%d %d %d", &n, &ka, &kb);
	int i, j;
	for (i = 0; i < ka; i++)
	{
		scanf("%d", &a[i]);
		a[i]--;
	}
	for (i = 0; i < kb; i++)
	{
		scanf("%d", &b[i]);
		b[i]--;
	}
	int dist = abs(a[0] - b[0]);
	for (i = 0; i < ka; i++)
	{
		j = id_b(a[i]);
		if (dist > abs(a[i] - j))
			dist = abs(a[i] - j);
	}
	int q, s, t;
	scanf("%d", &q);
	int ans;
	for (; q > 0; q--)
	{
		scanf("%d %d", &s, &t);
		s--;
		t--;
		ans = t - s;
		i = id_a(s);
		j = id_a(t);
		if (ans > abs(s - i) + abs(t - j))
			ans = abs(s - i) + abs(t - j);
		i = id_b(s);
		j = id_b(t);
		if (ans > abs(s - i) + abs(t - j))
			ans = abs(s - i) + abs(t - j);
		i = id_a(s);
		j = id_b(t);
		if (ans > abs(s - i) + abs(t - j) + dist)
			ans = abs(s - i) + abs(t - j) + dist;
		i = id_b(s);
		j = id_a(t);
		if (ans > abs(s - i) + abs(t - j) + dist)
			ans = abs(s - i) + abs(t - j) + dist;
		printf("%d\n", ans);
	}
	return 0;
}