codeforces 44c

using namespace std;
const int maxn = 200005;
int l[maxn], r[maxn], ans[maxn], cf[maxn];
int ()
{
    int m, n;
    cin >> m >> n;
    for (int i = 1; i <= n;i++)
    {
        int a, b;
        cin >> a >> b;
        cf[a]++;
        cf[b + 1]--;
    }
    int sum = 0;
    int flag = 0;
    for (int i = 1; i <= m;i++)
    {
        sum += cf[i];
        if(sum>1||sum==0)
        {
            flag = 1;
            cout << i << ' ' << sum << endl;
            break;
        }
    }
    if(!flag)
        cout << "OK" << endl;
}