409522: GYM103624 A Queen Anne's Revenge

Blackbeard is looking for sailors for his latest voyage! Given his fame and recognition, he got lots of volunteers when he decided to spread the word in the town of Caracas. However, Blackbeard realizes each sailor will get less of the $$$G$$$ total gold coins as he gets more sailors! Given that a sailor will mutiny if they receive less than $$$M$$$ coins, determine the maximum number of sailors that Blackbeard can have on his voyage if he does not want any soldier to mutiny!

The first line of input will contain two integers $$$M$$$ $$$(1 \le M \le 10^4)$$$, $$$G$$$ $$$(1 \le G \le 10^6)$$$, where $$$M < G$$$.

Output $$$S$$$, the maximum number of sailors Blackbeard can have in total given that he does not want any mutiny.

5 18

3