Frobenius coin problem#9615

Frobenius coin problem

1 second

128 megabytes

Easy

There are coins of two denominations $x$ and $y$ respectively. Find the largest sum $S$ that cannot be represented with these two denominations (assuming infinite supply of coins) and the total number $T$ of such not representable amounts. If such value does not exist, print NA.

Input

Two positive integers $x$ and $y (1 < x, y \leq 1 0^{9})$ y~(1 < x, y \le 10^9).

Output

Print in one line two numbers: $S$ and $T$ .

Examples

Example 1

Loading

Example 2

Loading

y (1 < x, y \leq 1 0^{9})