#include <bits/stdc++.h>
using namespace std;
#define f(i,k,n) for(int i=k; i<n; i++)
#define ll long long
const int inf = INT_MAX;

void solve()
{
    int n,m;
    cin>>n>>m;
    pair<int,int> a[m];
    f(i,0,m)    cin>>a[i].first>>a[i].second;
    int x[n]={0};
    f(i,0,m)
    {
        f(j,0,n)
        {
            if(a[i].first <j && a[i].second > j)    x[j]+=2;
            else if(a[i].first==j || a[i].second==j)    x[j]++;
        }
    }
    int maxi=0;
    int maxk=0;
    f(i,0,n)
    {
        if(maxk<x[i])
        {
            maxi=i;
            maxk=x[i];
        }
    }
    cout<<maxi<<" "<<maxk;

}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    //cin>>t;
    while(t--)  solve();
    return 0;
}