Катя #2

import java.util.Scanner;

public class Oprst {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int k = in.nextInt();
        int[] a = new int[n];
        int[] b = new int[k];
        int left;
        int right;
        int middle;
        for (int i = 0; i < a.length; i++) {
            a[i] = in.nextInt();
        }
        for (int i = 0; i < b.length; i++) {
            b[i] = in.nextInt();
        }
        for (int j = 0; j < b.length; j++) {


            left = 0;
            right = n - 1;
            while (left <= right) {
                middle = (right - left) / 2;
                if (a[middle] < b[j])
                    left = middle;
                if (a[middle] > b[j])
                    right = middle;
            }
            if (b[j] - a[left] <= a[right] - b[j])
                System.out.println(a[left]);
            else
                System.out.println(a[right]);

        }
        in.close();
    }

}