package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

func binarySearch(p int, A []int, L, R int, lower bool) int {
	l := L
	r := R
	for r-l > 1 {
		c := (r + l) / 2
		//fmt.Println(l, r, len(A))
		if A[c] < p {
			l = c
		} else if A[c] > p {
			r = c
		} else {
			return c
		}
	}
	if lower {
		return l
	} else {
		return r
	}
}

func getLen(A, B int) int {
	if A == 1e18 || B == 1e18 {
		return 1e18
	}
	if A < B {
		return 2*(A) + B
	} else {
		return A + 2*B
	}
}

func main() {
	sc := NewScanner()
	A, B, Q := sc.NextInt(), sc.NextInt(), sc.NextInt()
	s := make([]int, A)
	t := make([]int, B)
	x := make([]int, Q)
	for i := 0; i < A; i++ {
		s[i] = sc.NextInt()
	}
	for i := 0; i < B; i++ {
		t[i] = sc.NextInt()
	}
	for i := 0; i < Q; i++ {
		x[i] = sc.NextInt()

		l1 := binarySearch(x[i], s, 0, A, true)
		l2 := binarySearch(x[i], t, 0, B, true)
		r1 := binarySearch(x[i], s, -1, A-1, false)
		r2 := binarySearch(x[i], t, -1, B-1, false)

		Z := make([]int, 4)
		for i := 0; i < 4; i++ {
			Z[i] = 1e18
		}
		if s[0] <= x[i] && t[0] <= x[i] {
			Z[0] = max(x[i]-s[l1], x[i]-t[l2])
		}
		if s[A-1] >= x[i] && t[B-1] >= x[i] {
			Z[1] = max(s[r1]-x[i], t[r2]-x[i])
		}
		if s[0] <= x[i] && t[B-1] >= x[i] {
			Z[2] = getLen(x[i]-s[l1], t[r2]-x[i])
		}
		if s[A-1] >= x[i] && t[0] <= x[i] {
			Z[3] = getLen(s[r1]-x[i], x[i]-t[l2])
		}
		P := minA(Z...)
		//fmt.Println(l1, l2, r1, r2)
		//fmt.Printf("%+v\n", Z)
		fmt.Println(P)
	}

}
func max(a int, b int) int {
	if a < b {
		return b
	}
	return a
}

func min(a int, b int) int {
	if a < b {
		return a
	}
	return b
}

func minA(arg ...int) int {
	var s = arg[0]
	for _, v := range arg {
		s = min(s, v)
	}
	return s
}

type Scanner struct {
	r   *bufio.Reader
	buf []byte
	p   int
}

func NewScanner() *Scanner {
	rdr := bufio.NewReaderSize(os.Stdin, 1000)
	return &Scanner{r: rdr}
}
func (s *Scanner) Next() string {
	s.pre()
	start := s.p
	for ; s.p < len(s.buf); s.p++ {
		if s.buf[s.p] == ' ' {
			break
		}
	}
	result := string(s.buf[start:s.p])
	s.p++
	return result
}
func (s *Scanner) NextLine() string {
	s.pre()
	start := s.p
	s.p = len(s.buf)
	return string(s.buf[start:])
}
func (s *Scanner) NextInt() int {
	v, _ := strconv.Atoi(s.Next())
	return v
}
func (s *Scanner) NextInt64() int64 {
	v, _ := strconv.ParseInt(s.Next(), 10, 64)
	return v
}

func (s *Scanner) NextIntArray() []int {
	s.pre()
	start := s.p
	result := []int{}
	for ; s.p < len(s.buf)+1; s.p++ {
		if s.p == len(s.buf) || s.buf[s.p] == ' ' {
			v, _ := strconv.ParseInt(string(s.buf[start:s.p]), 10, 0)
			result = append(result, int(v))
			start = s.p + 1
		}
	}

	return result
}
func (s *Scanner) NextInt64Array() []int64 {
	s.pre()
	start := s.p
	result := []int64{}
	for ; s.p < len(s.buf)+1; s.p++ {
		if s.p == len(s.buf) || s.buf[s.p] == ' ' {
			v, _ := strconv.ParseInt(string(s.buf[start:s.p]), 10, 64)
			result = append(result, v)
			start = s.p + 1
		}
	}
	return result
}

func (s *Scanner) NextMap() map[int]bool {
	s.pre()
	start := s.p
	mp := map[int]bool{}
	for ; s.p < len(s.buf); s.p++ {
		if s.buf[s.p] == ' ' {
			v, _ := strconv.Atoi(string(s.buf[start:s.p]))
			mp[v] = true
			start = s.p + 1
		}
	}
	v, _ := strconv.Atoi(string(s.buf[start:s.p]))
	mp[v] = true

	return mp
}

func (s *Scanner) pre() {
	if s.p >= len(s.buf) {
		s.readLine()
		s.p = 0
	}
}
func (s *Scanner) readLine() {
	s.buf = make([]byte, 0)
	for {
		l, p, e := s.r.ReadLine()
		if e != nil {
			panic(e)
		}
		s.buf = append(s.buf, l...)
		if !p {
			break
		}
	}
}


Measured memory_bytes: 7680