#include <bits/stdc++.h>

using namespace std;

#define MAXN (int)1e5

int n, k, m, l, mx, counter, indmx, indcur;
bool x, ag1, ag2;
bool a[MAXN + 1]{0};
int i;
int j = 1;

int main()
{
    iostream::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> k;
    for(; i < k; ++i)
    {
        cin >> m >> l;
        fill(a+m, a+l+1,1);
    }
    for(; j <= n; ++j)
    {
        /*
        if(a[j])
        {
            if(mx < counter)
            {
                indmx = indcur;
                mx = counter;
            }
            counter = 0;
        }
        else
        {
            if(counter == 0)
            {
                indcur = j;
                counter++;
            }
            else counter++;
        }*/

        ag1 = a[j];
        ag2 = !ag1;

        x = ag2*(!!counter) + ag1*(mx < counter);
        indmx = ag2*indmx + ag1*(indmx*!x + indcur*x);
        mx = ag2*mx + ag1*(mx*!x + counter*x);
        indcur = ag2*(indcur*!x + j*x) + ag1*indcur;
        counter = ag2*(counter+1);

        //cout << ag1 << " " << ag2 << "\n";
        //cout << x << " " << indmx << " " << mx << " " << indcur << " " << counter << "\n";


    }

    if(mx < counter)
    {
        mx = counter;
        indmx = indcur;
    }


    if(mx == 0)
    {
        cout << "-1";
    }
    else cout << mx << " " << indmx;
}