#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <cassert>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <complex>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <bitset>
#include <functional>
#include <iterator>

using namespace std;

#define dump(n) cout<<"# "<<#n<<'='<<(n)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define peri(i,a,b) for(int i=int(b);i-->int(a);)
#define rep(i,n) repi(i,0,n)
#define per(i,n) peri(i,0,n)
#define iter(c) __typeof__((c).begin())
#define foreach(i,c) for(iter(c) i=(c).begin();i!=(c).end();++i)
#define all(c) (c).begin(),(c).end()
#define mp make_pair

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<string> vs;
typedef pair<int,int> pii;

const int INFTY=1<<29;
const double EPS=1e-9;

template<typename T1,typename T2>
ostream& operator<<(ostream& os,const pair<T1,T2>& p){
	return os<<'('<<p.first<<','<<p.second<<')';
}
template<typename T>
ostream& operator<<(ostream& os,const vector<T>& a){
	os<<'[';
	rep(i,a.size()) os<<(i?" ":"")<<a[i];
	return os<<']';
}

int Need(int x)
{
	x--;
	rep(i,5) x|=x>>(1<<i);
	return x+1;
}

struct SegmentTree{
	int size;
	vi data,index;
	SegmentTree(int s):size(Need(s)),data(size*2,-INFTY),index(size*2,-1){}
	SegmentTree(const vi& a):size(Need(a.size())),data(size*2,-INFTY),index(size*2,-1){
		copy(all(a),data.begin()+size);
		rep(i,a.size()) index[size+i]=i;
		for(int i=size;--i;){
			if(data[i*2]>=data[i*2+1])
				data[i]=data[i*2],index[i]=index[i*2];
			else
				data[i]=data[i*2+1],index[i]=index[i*2+1];
		}
	}
	int Get(int i){
		return data[size+i];
	}
	void Update(int i,int x){
		data[size+i]=x;
		for(i=(i+size)/2;i;i/=2){
			if(data[i*2]>=data[i*2+1])
				data[i]=data[i*2],index[i]=index[i*2];
			else
				data[i]=data[i*2+1],index[i]=index[i*2+1];
		}
	}
	int Query(int a,int b,int i,int l,int r){
		if(b<=l || r<=a) return -1;
		if(a<=l && r<=b) return index[i];
		int li=Query(a,b,i*2,l,(l+r)/2),ri=Query(a,b,i*2+1,(l+r)/2,r);
		int lv=li==-1?-INFTY:data[size+li],rv=ri==-1?-INFTY:data[size+ri];
		return lv>=rv?li:ri;
	}
	int Query(int a,int b){
		return Query(a,b,1,0,size);
	}
};

int main()
{
	for(int n,q;~scanf("%d%d",&n,&q) && n|q;){
		SegmentTree st(vi(n,0));
		rep(_,q){
			int a,v; cin>>a>>v; a--;
			st.Update(a,st.Get(a)+v);
			int i=st.Query(0,n);
			printf("%d %d\n",i+1,st.Get(i));
		}
	}
	
	return 0;
}