#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b) - 1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)

#define PB push_back
#define INF INT_MAX/3
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define CLR(a) memset(a,0,sizeof(a))

typedef long long int ll;

using namespace std;

int main(){
    while(true){
    int n,q;
    cin >> n;
    if(cin.eof()) break;
    cin >> q;
    vector< pair<int,int> > ar(n);
    vector<bool> u(q,false);
    REP(i,n) ar[i] = pair<int,int>(0,i+1);
    REP(i,q){
	int a,v;
	cin >> a >> v;
	if(!u[i]){
	    ar[a-1] = pair<int,int>(v,a);
	    u[i] = true;
	}else{
	    ar[a-1].first += v;
	}
    }
    sort(RALL(ar));
    cout << ar[0].second+1 << " "<< ar[0].first << endl;
    }
    return 0;
}