A ancient magnate is failing. His want is to have solely ONE of his descendant’s receive ALL of his treasure, however which one? He has N quantity of decendants. He works out a answer to locate the...

A ancient magnate is failing. His want is to have solely ONE of his descendant’s receive ALL of his treasure, however which one? He has N quantity of decendants. He works out a answer to locate the one fortunate baby who inherits his wealth. He will get N tokens, label every token with an integer fee and assign every token to a descendant. Each token receives a cost solely once. He locations all the tokens in a circle round him, numbered 1 to N, and begins removing one in K till there is solely one left... Write a software that takes two integer values N and K and prints the token wide variety of the fortunate decendant. Input Format The first line of the entry includes the two integers N and K. Constraints . zero