Gorwin is very interested in equations. Nowadays she gets an equation like this
${x_1} + {x_2} + {x_3} + \cdots + {x_n} = n$, and here \[\begin{array}{l}
0 \le {x_i} \le n{\kern 1pt} {\kern 1pt} {\kern 1pt} for{\kern 1pt} {\kern 1pt} {\kern 1pt} 1 \le i \le n\\
{x_i} \le {x_{i + 1}}{\kern 1pt} \le {x_i} + 1{\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} for{\kern 1pt} {\kern 1pt} {\kern 1pt} 1 \le i \le n - 1
\end{array}\]
For a certain $n$, Gorwin wants to know how many combinations of $xi$ satisfies above condition.
For the answer may be very large, you are expected output the result after it modular $m$.