#include <iostream>
#include <cmath>

int main () {
	int n, q;
	std::cin >> n >> q;

	int guards[n][2];
	int incidents[q][2];

	for (int i = 0; i < n; i++) {
		std::cin >> guards[i][0] >> guards[i][1];
	}
	for (int i = 0; i < q; i++) {
		std::cin >> incidents[i][0] >> incidents[i][1];
		int min = -1;
		for (int j = 0; j < n; j++) {
			int dx = std::abs(incidents[i][0] - guards[j][0]);
			int dy = std::abs(incidents[i][1] - guards[j][1]);

			int diagonal = std::min(dx, dy);
			int curMin = diagonal + dx - diagonal + dy - diagonal; 
			if (min == -1 || curMin < min) {
				min = curMin;
			}
		}
		std::cout << min << "\n";
	}

	
}