program lazy_faith
  implicit none
  integer(8)              :: a, b, q, n, x, i, k
  integer(8), allocatable :: u(:,:)
  read(*,*) a, b, q
  n = a + b
  allocate(u(n,2))
  u = 0
  do i = 1, a
    read(*,*) u(i,1)
    u(i,2) = 1
  end do
  do i = a+1, n
    read(*,*) u(i,1)
    u(i,2) = 2
  end do
  call merge_sort(n,u,1_8)
  do k = 1, q
    read(*,*) x
    call answer(n,u,x)
  end do
  deallocate(u)
  stop
contains
  subroutine answer(n,c,x)
    implicit none
    integer(8), intent(in) :: n, x, c(n,2)
    integer(8)             :: i, j, m0, m1, i0, i1
    if (x.lt.c(1,1)) then
      do i = 2, n
        if (c(i,2).ne.c(1,2)) then
          write(*,'(i0)') c(i,1)-x
          return
        end if
      end do
    end if
    if (x.gt.c(n,1)) then
      do i = n-1, 1, -1
        if (c(i,2).ne.c(n,2)) then
          write(*,'(i0)') x-c(i,1)
          return
        end if
      end do
    end if
    do i = 1, n-1
      if (x.lt.c(i,1).or.c(i+1,1).lt.x) cycle
      m0 = c(n,1)-c(1,1)
      m1 = m0
      i0 = -1
      i1 = -1
      do j = 1, n
        if (c(i,2).ne.c(j,2).and.abs(c(i,1)-c(j,1)).lt.m0) m0 = abs(c(i,1)-c(j,1))
        if (c(i+1,2).ne.c(j,2).and.abs(c(i+1,1)-c(j,1)).lt.m1) m1 = abs(c(i+1,1)-c(j,1))
      end do
      write(*,'(i0)') min(x-c(i,1)+m0,c(i+1,1)-x+m1)
      return
    end do
    return
  end subroutine answer
  subroutine merge_sort(n,c,idx)
    implicit none
    integer(8), intent(in)    :: n, idx
    integer(8), intent(inout) :: c(n,4)
    integer(8)                :: number, length, i, ubound
    number = n
    length = 1
    do while (number .gt. 1)
      do i = 1, number/2
        ubound = min(2*i*length,n)
        call merge(c(2*(i-1)*length+1:(2*i-1)*length,:),c((2*i-1)*length+1:ubound,:),idx)
      end do
      length = 2*length
      number = (number+1)/2
    end do
    return
  end subroutine merge_sort
  subroutine merge(c1,c2,idx)
    implicit none
    integer(8), intent(inout) :: c1(:,:), c2(:,:)
    integer(8), intent(in)    :: idx
    integer(8)                :: c(size(c1(:,1))+size(c2(:,1)),size(c1(1,:)))
    integer(8)                :: i1, i2, n1, n2
    i1 = 1
    i2 = 1
    n1 = size(c1(:,1))
    n2 = size(c2(:,1))
    do while (i1 .le. n1 .and. i2 .le. n2)
      if (c1(i1,idx) .lt. c2(i2,idx)) then
        c(i1+i2-1,:) = c1(i1,:)
        i1 = i1+1
      else
        c(i1+i2-1,:) = c2(i2,:)
        i2 = i2+1
      end if
    end do
    if (i1 .le. n1) then
      c(i1+i2-1:n1+n2,:) = c1(i1:n1,:)
    else if (i2 .le. n2) then
      c(i1+i2-1:n1+n2,:) = c2(i2:n2,:)
    end if
    c1 = c(1:n1,:)
    c2 = c(n1+1:n1+n2,:)
    return
  end subroutine merge
end program lazy_faith