#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// const ll MOD = 1e9+7;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m; cin >> n >> m;
    vector<int> p(n+2, 0);
    int u, v;
    for (int i = 0; i < m; i++) {
    	cin >> u >> v;
    	p[u]++; p[v+1]--;
    }
    
    for (int i = 1; i <= n; i++) {
    	p[i] += p[i-1];
    }
    
    
    int l = 1, r = 1;
    int mx = -1, first = 0;
	while (r <= n) {
		//cerr << l << " " << r << "\n";
		r = max(l, r);
		if (p[l] != 0) {
			l++;
			//cerr << "l++\n";
		} else {
			//cerr <<"itt\n";
			while (p[r+1] == 0 && r+1 <= n) {
				r++;
				//cerr << "r++\n";
			}
			if (r-l+1 > mx) {
				mx = r-l+1; first = l;
			}
			l++;
		}
	}
	
	/*for (int i = 79905+20091; i <= 79905+20099; i++) {
		cerr << p[i] << " ";
		if (i%100==0)cerr << "\n";
	}*/
	
	if (mx == -1) cout << -1 << "\n";
	else {
		cout << mx << " " << first << "\n";
	}

    return 0;
}