2 2
0 0
30 9
6 2
19 2
 1 1
1000000000 1000000000
1000000000 1000000000
 20 20
19 1
67 10
42 0
185 1
68 2
88 0
74 3
138 2
30 5
112 8
1 1
137 0
125 0
106 5
145 0
188 2
166 11
49 1
171 5
15 0
166 1
171 1
29 1
190 1
76 1
146 1
84 1
169 1
58 1
111 1
81 1
33 1
144 1
182 0
44 0
63 1
176 1
68 1
184 1
147 1
 20 20
87 2
77 3
88 5
54 3
49 1
114 1
103 0
173 0
126 0
28 6
144 6
191 6
14 4
44 4
19 1
165 9
5 1
183 3
113 9
147 3
47 1
45 0
34 1
191 0
199 1
154 1
163 1
142 0
54 1
136 1
167 1
151 1
166 1
108 1
79 1
172 0
76 1
74 1
31 1
95 1
 10 10
33 2
922 34
480 105
844 5
739 39
325 20
999 88
462 104
225 5
93 4
13 15
323 9
152 20
785 11
512 4
859 8
327 14
818 9
794 13
99 20
 20 20
71 3
168 4
112 2
49 3
140 0
32 1
17 1
9 1
180 2
84 0
47 2
134 0
58 1
75 1
0 3
107 7
161 6
143 3
183 5
121 4
190 1
140 1
83 0
174 0
192 1
119 0
164 1
79 1
31 1
17 1
125 1
18 1
136 0
115 1
133 1
40 0
181 1
25 1
114 1
113 1
 2 2
0 19
29 6
5 3
17 3
 2 2
1 6
26 24
20 2
1 2
 2 2
9 1
0 19
17 3
18 3
 2 2
32 0
0 9
14 2
10 3
 2 2
0 11
19 9
8 2
16 2
 2 2
23 3
5 4
1 3
11 3
 20 20
52 0
126 2
197 1
28 4
69 2
88 7
78 3
105 1
157 2
143 0
16 4
182 6
104 10
171 2
36 1
64 7
0 3
118 1
13 0
153 0
185 1
164 1
51 1
0 1
48 0
147 1
162 1
96 1
5 1
190 1
127 1
79 0
62 1
63 1
29 1
181 1
137 1
42 1
80 1
181 1
 2 2
0 1
28 18
9 2
2 1
 20 20
76 3
136 2
58 3
18 9
1 2
123 6
186 2
163 2
6 1
73 3
91 4
37 2
141 6
103 0
26 5
155 0
52 0
174 0
187 8
104 7
33 1
173 1
138 1
2 1
106 1
155 1
101 0
168 1
114 1
98 0
72 1
120 1
43 1
73 1
25 1
183 1
177 0
54 1
179 1
131 1
 2 2
0 16
15 12
5 2
8 3
 20 20
177 4
62 0
45 7
190 0
134 0
49 0
158 6
71 0
113 3
106 4
152 1
103 0
27 2
76 1
28 1
10 8
0 0
173 9
135 10
94 3
15 1
33 1
122 1
136 1
17 1
85 1
95 1
41 1
133 1
136 0
150 1
126 1
21 1
200 1
102 0
177 1
89 1
161 1
178 1
114 1
 20 20
150 4
138 3
95 0
25 1
80 0
72 3
127 7
29 1
153 5
174 4
197 1
170 4
104 0
11 1
41 4
67 4
48 5
119 3
94 6
6 3
25 0
91 1
18 0
120 1
45 1
177 1
80 1
174 1
136 1
182 1
97 1
116 1
114 1
119 1
114 1
46 1
31 1
186 1
123 1
169 1
 20 20
77 6
0 3
68 1
25 4
179 5
27 0
187 0
159 4
11 2
53 1
107 3
106 0
48 7
150 3
131 4
171 5
43 2
124 5
136 3
90 5
153 1
75 1
178 1
1 0
148 1
19 1
15 1
116 1
174 1
191 1
80 0
44 1
122 1
136 1
35 1
11 1
40 0
7 1
186 1
191 1
 2 2
34 1
0 5
2 2
19 0
 20 20
81 6
77 2
22 1
155 3
94 0
110 2
11 5
116 2
156 5
167 2
31 3
47 5
3 4
194 3
177 6
83 0
124 10
48 0
147 0
64 3
88 0
146 1
66 1
82 1
167 1
53 1
161 1
177 1
187 0
40 1
182 0
128 1
172 1
155 0
157 1
166 1
96 1
146 1
36 1
125 1
 20 20
19 5
186 3
32 3
46 2
74 2
114 1
162 3
3 8
87 3
101 0
4 1
127 0
157 6
128 8
147 3
189 1
52 11
61 1
175 0
70 2
65 1
143 1
82 1
110 1
162 1
150 1
29 1
4 1
186 1
132 1
166 1
183 1
44 1
59 1
192 1
146 1
83 1
140 1
75 1
101 1

0 0
0 9
 1 2000000000
 0 1
2 12
0 0
0 1
0 2
0 0
0 3
0 2
1 6
0 8
0 1
0 0
0 0
1 6
0 0
1 3
4 15
0 1
0 5
0 0
 0 2
1 4
0 5
1 4
0 1
0 1
0 0
0 0
0 0
2 8
0 6
1 6
0 4
2 5
0 1
3 11
0 1
0 3
0 9
0 3
 0 2
0 34
0 105
0 5
0 39
1 34
0 88
1 108
0 5
0 4
 0 3
0 4
0 2
0 3
1 1
0 1
2 3
0 1
1 3
0 0
0 2
0 0
0 1
0 1
0 3
3 10
1 7
0 3
0 5
1 5
 2 25
0 6
 1 8
0 24
 0 1
2 25
 0 0
0 9
 1 13
0 9
 0 3
0 4
 0 0
1 3
0 1
1 5
0 2
0 7
2 4
0 1
0 2
0 0
0 4
1 7
0 10
0 2
0 1
0 7
1 4
0 1
0 0
0 0
 0 1
0 18
 0 3
1 3
0 3
1 10
1 3
0 6
0 2
0 2
0 1
1 4
0 4
0 2
0 6
0 0
0 5
1 1
0 0
0 0
0 8
1 8
 2 21
0 12
 0 4
0 0
0 7
0 0
0 0
0 0
1 7
0 0
1 4
0 4
0 1
0 0
0 2
0 1
0 1
2 10
0 0
2 11
2 11
1 4
 0 4
0 3
0 0
1 1
1 1
0 3
0 7
0 1
0 5
1 5
0 1
1 5
0 0
0 1
2 6
0 4
0 5
3 6
1 7
0 3
 1 6
1 3
0 1
0 4
0 5
0 0
0 0
0 4
1 3
0 1
0 3
0 0
0 7
1 4
0 4
1 6
1 3
0 5
1 4
0 5
 0 1
1 7
 2 7
0 2
0 1
2 4
0 0
0 2
0 5
0 2
1 6
1 3
0 3
0 5
0 4
0 3
2 7
0 0
2 12
0 0
0 0
1 4
 0 5
1 4
0 3
0 2
1 3
0 1
0 3
1 9
0 3
1 1
0 1
0 0
1 7
1 9
1 4
0 1
1 12
0 1
0 0
0 2

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U>
using Pa = pair<T, U>;
template <class T>
using vec = vector<T>;
template <class T>
using vvec = vector<vec<T>>;
template <typename Monoid, typename OperatorMonoid, typename F, typename G,
          typename H>
class LazySegmentTree {
 private:
  int sz, height;
  vec<Monoid> data;
  vec<OperatorMonoid> lazy;
  const F op;
  const G homo;
  const H comp;
  const Monoid e;
  const OperatorMonoid Oe;

 public:
  LazySegmentTree(int n, const F op, const G homo, const H comp,
                  const Monoid &e, const OperatorMonoid Oe)
      : op(op), homo(homo), comp(comp), e(e), Oe(Oe) {
    sz = 1;
    height = 0;
    while (sz <= n) sz <<= 1, height++;
    data.assign(2 * sz, e);
    lazy.assign(2 * sz, Oe);
  }
  void set(int k, const Monoid &x) { data[k + sz] = x; }
  void build() {
    for (int k = sz - 1; k > 0; k--) {
      data[k] = op(data[2 * k], data[2 * k + 1]);
    }
  }
  inline void propagate(int k) {
    if (lazy[k] != Oe) {
      lazy[2 * k] = comp(lazy[2 * k], lazy[k]);
      lazy[2 * k + 1] = comp(lazy[2 * k + 1], lazy[k]);
      data[k] = reflect(k);
      lazy[k] = Oe;
    }
  }
  inline Monoid reflect(int k) {
    return lazy[k] == Oe ? data[k] : homo(data[k], lazy[k]);
  }
  inline void recalc(int k) {
    while (k >>= 1) data[k] = op(reflect(2 * k), reflect(2 * k + 1));
  }
  inline void thrust(int k) {
    for (int i = height; i > 0; i--) propagate(k >> i);
  }
  void update(int a, int b, const OperatorMonoid &x) {
    thrust(a += sz);
    thrust(b += sz - 1);
    for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
      if (l & 1) lazy[l] = comp(lazy[l], x), ++l;
      if (r & 1) --r, lazy[r] = comp(lazy[r], x);
    }
    recalc(a);
    recalc(b);
  }
  Monoid query(int a, int b) {
    thrust(a += sz);
    thrust(b += sz - 1);
    Monoid L = e, R = e;
    for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
      if (l & 1) L = op(L, reflect(l++));
      if (r & 1) R = op(reflect(--r), R);
    }
    return op(L, R);
  }
  Monoid operator[](const int &k) { return query(k, k + 1); }
};
template <class T>
class Compress {
 public:
  map<T, int> idx;
  map<int, T> value;
  vector<T> cmp;
  int N;
  Compress(vector<T> v) {
    for (auto &x : v) cmp.push_back(x);
    sort(cmp.begin(), cmp.end());
    cmp.erase(unique(cmp.begin(), cmp.end()), cmp.end());
    N = cmp.size();
    for (int i = 0; i < N; i++) idx[cmp[i]] = i;
  }
  int id(T val) { return idx[val]; }
  T val(int id) { return cmp[id]; }
};
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int N, M;
  cin >> N >> M;
  vec<ll> X(N), T(N), P(M), B(M);
  for (int i = 0; i < N; i++) cin >> X[i] >> T[i];
  for (int i = 0; i < M; i++) cin >> P[i] >> B[i];
  Compress<ll> cmp(P);
  int m = cmp.N;
  vec<int> idx(N);
  iota(idx.begin(), idx.end(), 0);
  sort(idx.begin(), idx.end(), [&](int i, int j) { return X[i] < X[j]; });
  const ll inf = 1e18;
  auto op1 = [](ll a, ll b) { return min(a, b); };
  auto homo1 = [](ll a, ll b) { return b != inf ? b : a; };
  auto comp1 = homo1;
  struct mosq {
    ll cnt, size;
    bool operator==(const mosq &r) const {
      return cnt == r.cnt && size == r.size;
    }
    bool operator!=(const mosq &r) const {
      return cnt != r.cnt || size != r.size;
    }
  };
  mosq e = {0, 0};
  auto op2 = [](mosq a, mosq b) {
    return (mosq){a.cnt + b.cnt, a.size + b.size};
  };
  auto homo2 = [](mosq a, mosq b) { return b.cnt != inf ? b : a; };
  auto comp2 = homo2;
  LazySegmentTree<ll, ll, decltype(op1), decltype(homo1), decltype(comp1)> flog(
      m, op1, homo1, comp1, inf, inf);
  LazySegmentTree<mosq, mosq, decltype(op2), decltype(homo2), decltype(comp2)>
      mosqs(m, op2, homo2, comp2, e, {inf, inf});
  int a = 0;
  for (auto i : idx) {
    while (a < m && cmp.val(a) < X[i]) a++;
    while (a < m && cmp.val(a) <= X[i] + T[i]) {
      flog.set(a, i);
      a++;
    }
  }
  flog.build();
  vec<ll> ans(N);
  vec<ll> W = cmp.cmp;
  for (int q = 0; q < M; q++) {
    ll p = P[q], b = B[q];
    mosq now = mosqs[cmp.id(p)];
    mosqs.update(cmp.id(p), cmp.id(p) + 1, (mosq){now.cnt + 1, now.size + b});
    ll id = flog[cmp.id(p)];
    if (id == inf) continue;
    while (true) {
      ll r = upper_bound(W.begin(), W.end(), X[id] + T[id]) - W.begin();
      ll l = cmp.id(p);
      flog.update(l, r, id);
      mosq sum = mosqs.query(l, r);
      if (sum.cnt == 0) break;
      ans[id] += sum.cnt;
      T[id] += sum.size;
      mosqs.update(l, r, e);
    }
  }
  for (int i = 0; i < N; i++) cout << ans[i] << " " << T[i] << "\n";
}
