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

#include <iostream>
#include <vector>
#include <cmath>

 using namespace std;

 int n, m;
 vector<pair<int, int> > T;

 void calc(int sum) {
      int t1, t2;
      int s1, s2;
      int minn=99999, k1=-1;
      for(t1 = 0, t2 = 0; t1 < 20000; ++t1, --t2) {
             s1 = 0; s2 = 0;
             for(int i = 0; i < T.size(); ++i) {
                     s1 += (abs(t1-T[i].first)*T[i].second);
                     s2 += (abs(t2-T[i].first)*T[i].second);
             }
             if( abs(s1 - sum) < minn) {
                 minn = abs(s1-sum);
                 k1 = t1;
             }
             if( abs(s2 - sum) < minn) {
                 minn = abs(s2-sum);
                 k1 = t2;
             }
      }
      cout << k1 << ' ' << minn << '\n';
 }

 int main() {
     cin >> n >> m;
     T.resize(n);
     for(int i = 0; i < n; ++i)
             cin >> T[i].first >> T[i].second;
     for(int i = 0; i < m; ++i) {
             int t;
             cin >> t;
             calc(t);
     }
     return 0;
 }
