Given two positive integers n and x, return the number of ways n can be expressed as the sum of the xth power of unique positive integers. In other words, determine the number of sets of unique positive integers $\\{c_1, c_2, \dots, c_k\\}$ such that $n = c_1^x + c_2^x + \dots + c_k^x$.

Since the answer may be very large, return it modulo $10^9 + 7$.

Constraints:

• $1 \leq$ n $\leq 300$

• $1 \leq$ x $\leq 5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.