/*
TASK: festb
LANG: C++
*/
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
    int i,j,m,n,a[20000],d[20000],sum[20000],kur1=0,kur2=0,kurn,kur3,kur4,suck1,suck2;
    cin>>m>>n;
    for(i=0;i<m;i++)cin>>a[i]>>d[i];
    for(i=0;i<n;i++)cin>>sum[i];
	for(j=0;j<n;j++)
	{
			kur1+=d[j]*a[j];
			kur2+=d[j];
	}
	for(i=0;i<n;i++)
	{
		kurn=sum[i]-kur1;
		kur3=kurn/(-1*kur2);
		if(kur3>=0)kur4=kur3+1;
		else kur4=kur3-1;
		suck1=kur3*(-1)*kur2+kur1;
		suck2=kur4*(-1)*kur2+kur1;
		if(abs(sum[i]-suck1)<abs(suck2-sum[i]))cout<<kur3<<" "<<abs(suck1-sum[i])<<"\n";
		else cout<<kur4<<" "<<abs(suck2-sum[i])<<"\n";
	}
    return 0;
}
