#include <iostream>
//#include <fstream>
#include <vector>
using namespace std;
//ifstream cin("input.in");
//ofstream cout ("output.out");
using ll= long long;
using P= pair<ll,ll>;

ll n,m,i,j,a,b,maxi=-1,p;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL), cout.tie(NULL);

    cin>>n>>m;
    vector <ll> t(n+2,0);
    vector <P> ship(m+1,{0,0});
    for (i=1;i<=m;++i)
    {
        cin>>ship[i].first>>ship[i].second;
        t[ship[i].first]+=2;
        t[ship[i].second+1]-=2;
    }

    for (i=1;i<=n;++i) t[i]+=t[i-1];
    for (i=1;i<=m;++i)
    {
        t[ship[i].first]--;
        t[ship[i].second]--;
    }

    for (i=1;i<=n;++i)
    {
        if (t[i]>maxi)
        {
            maxi=t[i];
            p=i;
        }
    }
    cout<<p<<" "<<maxi;
}