List every pair of distinct integers in \([a,b]\) whose greatest common divisor is \(1\).

Input

One line containing \(a\) and \(b\).

The input satisfies:

• \(1 \le a \le b \le 10^3\)

Output

Print each pair as (x,y) with \(x<y\), ordered first by \(x\) and then by \(y\).

Example

Input

1 2

Output

(1,2)