There are coins of two denominations and respectively. Find the largest sum that cannot be represented with these two denominations (assuming infinite supply of coins) and the total number of such not representable amounts. If such value does not exist, print "NA".
Two positive integer and .
Print in one line two numbers: and .