Given $1$D points on a line labeled from $0$ to n $- 1$, find the total number of ways to draw k non-overlapping line segments.

Each segment must connect two distinct integer points with positive length. Two segments are considered non-overlapping if they do not cover any common interval of positive length. They are allowed to share an endpoint.

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

Constraints:

• $2 \leq$ n $\leq 1000$

• $1 \leq$ k $\leq$ n $- 1$

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.