The bored Bob is playing a number game. In the beginning, there are `n` numbers. For each turn, Bob will take out two numbers from the remaining numbers, and get the product of them. There is a condition that the sum of two numbers must be not larger than `k`.

Now, Bob is curious to know what the maximum sum of products he can get, if he plays **at most** `m` turns. Can you tell him?

提交代码