PROGRAMMING:Prime Decision
For the expression n ^ 2 + N + 41, when n takes integer values (including X, y) in the range of (x, y) (- 39 < = x < y < = 50), it is determined whether the values of the expression are all prime numbers.
###Input format:
There are several groups of input data, each group occupies a line, which is composed of two integers x and Y. when x = 0 and y = 0, it means the end of input, and the line will not be processed.
###Output format:
For each value in a given range, if the value of the expression is all prime, then output "OK", otherwise output "sorry", each output occupies one line.
###Input example:
Here is a set of inputs. For example:
```in
0 1
0 0
```
###Output example:
The corresponding output is given here. For example:
```out
OK
```
answer：If there is no answer, please comment
###Input format:
There are several groups of input data, each group occupies a line, which is composed of two integers x and Y. when x = 0 and y = 0, it means the end of input, and the line will not be processed.
###Output format:
For each value in a given range, if the value of the expression is all prime, then output "OK", otherwise output "sorry", each output occupies one line.
###Input example:
Here is a set of inputs. For example:
```in
0 1
0 0
```
###Output example:
The corresponding output is given here. For example:
```out
OK
```
answer：If there is no answer, please comment