#include<iostream>
#include<iomanip>
#include<algorithm>
#include<array>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<numeric>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<unordered_map>
#include<queue>
#include<vector>
using namespace std;

//#define int ll
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;

#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
#define dump(o) {cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) {cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
const int MOD = 1e9 + 7;

signed main() {
	int n, q; cin >> n >> q;
	static int A[1000010] = {};
	auto cmp = [](pii a, pii b) {return a.first == b.first ? a.second > b.second : a.first < b.first; };
	priority_queue < pii, vector<pii>, decltype(cmp) > pq(cmp);
	rep(i, 0, q) {
		int a, v; cin >> a >> v;
		A[a] += v;
		pq.push(pii(A[a], a));
		pii t;
		while (true) {
			t = pq.top();
			if (t.first != A[t.second])	pq.pop();
			else break;
		}
		cout << t.second << " " << t.first << endl;
	}
	return 0;
}