#include<iostream>
#include<string.h>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<time.h>
#include<stdlib.h>
#include<vector>
#include<stack>
#include<ctype.h>
#include<cstring>
using namespace std;
int n,m,a,b;
int nn[505][505];
void dfs(int i,int j,int s)
{
	if(i<1||j<1||i>n||j>m||nn[i][j]>s)
	{
		return ;
	}
	nn[i][j]=s;
	s++;
	dfs(i+1,j,s);
	dfs(i,j-1,s);
	dfs(i,j+1,s);
	dfs(i-1,j,s);
}
int main()
{
	int x,y;
	cin>>n>>m>>a>>b;
	for(int i=1;i<=a;i++)
	{
		cin>>x>>y;
		dfs(x,y,0);
	}
	for(int i=1;i<=b;i++)
	{
		cin>>x>>y;
		cout<<nn[x][y]<<endl;
	}
	return 0;
}