#include <fstream>
#include <queue>
#include <algorithm>
using namespace std;

struct lista
{
	int a, b;
	int ind;
}v[100005];

inline bool cmp (lista x, lista y)
{
	return x.a<y.a || (x.a==y.a && x.b<y.b);
};

int main()
{
	ifstream fin("vmin.in");
	ofstream fout("vmin.out");
	int n, m, t,i;
	
	fin>>n >>m;
	
	for(i=1;i<=n;++i)
	{
		fin>>v[i].a >>v[i].b;
		v[i].ind=i;
	}
	
	sort(v+1,v+n+1,cmp);
	
	for(;m;--m)
	{
		fin>>t;
		long long valmin=(1LL*1<<60),poz=0;
		for(i=1;i<=n;++i)
		{
			if(valmin>1LL*t*v[i].a+v[i].b)
			{
				valmin=1LL*t*v[i].a+v[i].b;
				poz=i;
			}
		}
		fout<<v[poz].ind <<" ";
	}
	
	return 0;
}