Problem: School holidays come in Berland. The holidays are going to continue for n days. The students of school №N are having the time of their lives and the IT teacher Marina Sergeyevna, who has spent all the summer busy checking the BSE (Berland State Examination) results, has finally taken a vacation break! Some people are in charge of the daily watering of flowers in shifts according to the schedule. However when Marina Sergeyevna was making the schedule, she was so tired from work and so lost in dreams of the oncoming vacation that she perhaps made several mistakes. In fact, it is possible that according to the schedule, on some days during the holidays the flowers will not be watered or will be watered multiple times. Help Marina Sergeyevna to find a mistake.

Input

The first input line contains two numbers n and m (1 ≤ n, m ≤ 100) — the number of days in Berland holidays and the number of people in charge of the watering respectively. The next m lines contain the description of the duty schedule. Each line contains two integers ai and bi (1 ≤ ai ≤ bi ≤ n), meaning that the i-th person in charge should water the flowers from the ai-th to the bi-th day inclusively, once a day. The duty shifts are described sequentially, i.e. bi ≤ ai + 1 for all i from 1 to n - 1 inclusively. 

Output

Print "OK" (without quotes), if the schedule does not contain mistakes. Otherwise you have to find the minimal number of a day when the flowers will not be watered or will be watered multiple times, and output two integers — the day number and the number of times the flowers will be watered that day.

Examples

Input

10 5
1 2
3 3
4 6
7 7
8 10


Output

OK


Input

10 5
1 2
2 3
4 5
7 8
9 10


Output

2 2


Input

10 5
1 2
3 3
5 7
7 7
7 10


Output

4 0

Note

Keep in mind that in the second sample the mistake occurs not only on the second day, but also on the sixth day, when nobody waters the flowers. However, you have to print the second day, i.e. the day with the minimal number.

Solution (in JAVA):

Solution:
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int m = in.nextInt();
		Map<Integer, Integer> map = new HashMap<Integer, Integer>();
		for( int i=0; i<m; i++ ) {
			int a = in.nextInt();
			int b = in.nextInt();
			for (int j = a; j <= b; j++) {
				if( map.containsKey(j) ) {
					map.put(j, map.get(j)+1);
				} else {
					map.put(j, 1);
				}
			}
		}
		int k = 1;
		for( Map.Entry<Integer, Integer> ent:map.entrySet() ) {
			if( ent.getKey() != k ) {
				System.out.println(k + " " + 0);
				return;
			} if( ent.getValue() != 1 ) {
				System.out.println(ent.getKey() + " " + ent.getValue());
				return;
			}
			k++;
		}
		if( !map.containsKey(n) ) {
			System.out.println(n + " " + 0);
			return;
		}
		System.out.println("OK");
	}
}