#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cassert>
#include <vector>
#include <string>
#include <cmath>
#include <map> 
#include <sstream>
#include <cstdio>
using namespace std;
 
const int MAX= 10000100;

#define loop(i,a,b) for(int i = a ; i < b ; i ++)
#define rep(i,a) loop(i,0,a)
#define all(a) (a).begin(),(a).end()
#define ll long long int
#define gcd(a,b) __gcd(a,b)
#define pb(a) push_back(a)
int GCD(int a, int b) {if(!b) return a; return gcd(b, a%b);}
int lcm(int a, int b) {return a*b / gcd(a, b);}

int main(void){
  int n,q;
  while(cin>>n>>q){
    vector<int> sum(n,0);
    int a,v;
    int maxa,maxv;
    maxv = maxa = -1 * MAX;
    
    rep(i,q){
      cin>>a>>v;
      sum[--a]+=v;
      maxv = -1 *(1e8);
      rep(j,n){
	if(sum[j] > maxv){
	  maxa = j + 1;
	  maxv = sum[j];
	}
      }
      cout<<maxa<<" "<<maxv<<endl;
    }
  }

}