Frobenius coin problem
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".
Two positive integer x and y (1 < x, y ≤
Print in one line two numbers: S and T.