// Created by Armin on 2/1/2025.

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pp = pair<int, int>;


int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
    
    int n, m; cin >> n >> m;
    vector<int> prefix(n + 2);
    for (int i = 0; i < m; i++) {
      int a, b; cin >> a >> b;
      prefix[a]++;
      prefix[b + 1]--;
    }
    
    for (int i = 1; i <= n; i++) {
      prefix[i] += prefix[i - 1];
    }
    prefix[0] = 1;
    prefix[n + 1] = 1;
    
    int start = 0, maxstart = 0, maxlength = -1;
    for (int i = 1; i <= n + 1; i++) {
      if (prefix[i] != 0) {
        if (i - start - 1 > maxlength) {
          maxlength = i - start - 1;
          maxstart = start + 1;
        }
        start = i;
      }
    }
    if (maxlength >= 0) {
      cout << maxlength << " " << maxstart;
    } else {
      cout << "-1\n";
    }

    return 0;
}