/*
TASK: festb
LANG: C++
*/


#include<iostream>
using namespace std;

#define MAXN 200000

long long A, S, E[12], m, n, T=0, K=0, i, j, P[6], q;
int B;


long long modul(long long a){
 return (a>0)?a:(-a);}

int sum(){

 long long min;
 E[0]=(S+T)/K;
 E[1]=(S-T)/K;
 E[2]=(S+T)/K+1;
 E[3]=(S-T)/K+1;
 E[4]=(S+T)/K-1;
 E[5]=(S-T)/K-1;
 E[6]=-(S+T)/K;
 E[7]=-(S-T)/K;
 E[8]=-(S+T)/K+1;
 E[9]=-(S-T)/K+1;
 E[10]=-(S+T)/K-1;
 E[11]=-(S-T)/K-1;


 for(i=0; i<12; i+=2)
     P[i]=modul(K*E[i]-S-T);

 for(i=1; i<12; i+=2)
     P[i]=modul(K*E[i]-S+T);

 min=P[0];
 j=0;
 for(i=1; i<12; i++)
    if(min>P[i]) {min=P[i]; j=i;}

 cout<<E[j]<<" "<<P[j]<<endl;

 return 0;
}



int main(){
 cin>>m>>n;

 for(i=0; i<m; i++){
    cin>>A>>B;
    T+=A*B;
    K+=B;
   }

 for(q=0; q<n; q++){
    cin>>S;
    sum();
   }

 return 0;
}


