10.2.1

import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Scanner;

/**
 * Created by Сергей on 27.05.2016.
 */
public class Sol {
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);
        int n,m;
        int high,low,mid;
        n=sc.nextInt();
        m=sc.nextInt();

        int a[]=new int[n];
        int b[]=new int[m];

        for (int i=0;i<n;i++) {
            a[i]=sc.nextInt();
        }
        for (int i=0;i<m;i++) {
            b[i]=sc.nextInt();
        }

        for (int i=0;i<m;i++) {
            high=n-1;
            low=0;
            mid=(high+low)/2;
            while (low!=high-1)
            {
                mid=(high+low)/2;
                if (a[mid]>b[i]) high=mid;
                if (a[mid]<b[i]) low=mid;
                if (a[mid]==b[i]) {
                    break;
                }
            }
            if (a[mid]==b[i]) System.out.println(a[mid]);
            else
            {
                if (Math.abs(a[low]-b[i])>Math.abs(a[high]-b[i]))
                    System.out.println(a[high]);
                else {
                        System.out.println(a[low]);
                }
            }
        }
    }
}