# define _CRT_SECURE_NO_WARNINGS 1
# include <iostream>
# include <string>
# include <vector>
# include <algorithm>
# include <cstdlib>
# include <cstdio>
# include <cstring>
# include <cstdlib>
# include <iomanip>
# include <queue>
# include <sstream>
# include <climits>
# include <cmath>
# include <list>
# include <functional>
# include <set>
# include <map>
# include <stack>
using namespace std;
# define M_PI 3.141592
# define FOR(i,n) for(int i=0;i<(int)n;i++)
# define FORI(i,k,n) for(int i=k;i<(int)n;i++)
# define toRad 2.0*M_PI/360.0
# define inin(x) int x;cin>>x;
# define all(x) x.begin(),x.end()
# define debug(x) cout<<#x<<" :"<<x<<endl;
# define rep(i,n) for(int i=0;i<(int)n;i++)
# define EPS 1e-12
# define pri_max 60000
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<vi> vvi;
int a[1000001] = {};
int main()
{
	set<pii, greater<pii> > s;
	set<pii, greater<pii> >::iterator it;
	int n, q;
	cin >> n >> q;
	for (int i = 0; i < q; i++)
	{
		pii now;
		cin >> now.second >> now.first;
		now.second = -now.second;

		it = s.find(pii(a[-now.second], now.second));

		a[-now.second] += now.first;

		if (it == s.end())
		{
			s.insert(now);
		}
		else
		{
			s.erase(it);
			s.insert(pii(a[-now.second], now.second));
		}
		now = *s.begin();
		cout << -now.second << " " << now.first << endl;;
	}

}